Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/link.c: TIPC link code | |
c4307285 | 3 | * |
170b3927 | 4 | * Copyright (c) 1996-2007, 2012-2014, Ericsson AB |
198d73b8 | 5 | * Copyright (c) 2004-2007, 2010-2013, Wind River Systems |
b97bf3fd PL |
6 | * All rights reserved. |
7 | * | |
9ea1fd3c | 8 | * Redistribution and use in source and binary forms, with or without |
b97bf3fd PL |
9 | * modification, are permitted provided that the following conditions are met: |
10 | * | |
9ea1fd3c PL |
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. | |
b97bf3fd | 19 | * |
9ea1fd3c PL |
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 | |
b97bf3fd PL |
34 | * POSSIBILITY OF SUCH DAMAGE. |
35 | */ | |
36 | ||
37 | #include "core.h" | |
b97bf3fd | 38 | #include "link.h" |
b97bf3fd | 39 | #include "port.h" |
9816f061 | 40 | #include "socket.h" |
b97bf3fd | 41 | #include "name_distr.h" |
b97bf3fd PL |
42 | #include "discover.h" |
43 | #include "config.h" | |
b97bf3fd | 44 | |
796c75d0 YX |
45 | #include <linux/pkt_sched.h> |
46 | ||
2cf8aa19 EH |
47 | /* |
48 | * Error message prefixes | |
49 | */ | |
50 | static const char *link_co_err = "Link changeover error, "; | |
51 | static const char *link_rst_msg = "Resetting link "; | |
52 | static const char *link_unk_evt = "Unknown link event "; | |
b97bf3fd | 53 | |
a686e685 AS |
54 | /* |
55 | * Out-of-range value for link session numbers | |
56 | */ | |
a686e685 AS |
57 | #define INVALID_SESSION 0x10000 |
58 | ||
c4307285 YH |
59 | /* |
60 | * Link state events: | |
b97bf3fd | 61 | */ |
b97bf3fd PL |
62 | #define STARTING_EVT 856384768 /* link processing trigger */ |
63 | #define TRAFFIC_MSG_EVT 560815u /* rx'd ??? */ | |
64 | #define TIMEOUT_EVT 560817u /* link timer expired */ | |
65 | ||
c4307285 YH |
66 | /* |
67 | * The following two 'message types' is really just implementation | |
68 | * data conveniently stored in the message header. | |
b97bf3fd PL |
69 | * They must not be considered part of the protocol |
70 | */ | |
71 | #define OPEN_MSG 0 | |
72 | #define CLOSED_MSG 1 | |
73 | ||
c4307285 | 74 | /* |
b97bf3fd PL |
75 | * State value stored in 'exp_msg_count' |
76 | */ | |
b97bf3fd PL |
77 | #define START_CHANGEOVER 100000u |
78 | ||
a18c4bc3 | 79 | static void link_handle_out_of_seq_msg(struct tipc_link *l_ptr, |
b97bf3fd | 80 | struct sk_buff *buf); |
247f0f3c | 81 | static void tipc_link_proto_rcv(struct tipc_link *l_ptr, struct sk_buff *buf); |
3bb53380 | 82 | static int tipc_link_tunnel_rcv(struct tipc_node *n_ptr, |
170b3927 | 83 | struct sk_buff **buf); |
a18c4bc3 | 84 | static void link_set_supervision_props(struct tipc_link *l_ptr, u32 tolerance); |
a18c4bc3 PG |
85 | static void link_state_event(struct tipc_link *l_ptr, u32 event); |
86 | static void link_reset_statistics(struct tipc_link *l_ptr); | |
87 | static void link_print(struct tipc_link *l_ptr, const char *str); | |
247f0f3c YX |
88 | static void tipc_link_sync_xmit(struct tipc_link *l); |
89 | static void tipc_link_sync_rcv(struct tipc_node *n, struct sk_buff *buf); | |
7ae934be EH |
90 | static int tipc_link_input(struct tipc_link *l, struct sk_buff *buf); |
91 | static int tipc_link_prepare_input(struct tipc_link *l, struct sk_buff **buf); | |
31e3c3f6 | 92 | |
b97bf3fd | 93 | /* |
05790c64 | 94 | * Simple link routines |
b97bf3fd | 95 | */ |
05790c64 | 96 | static unsigned int align(unsigned int i) |
b97bf3fd PL |
97 | { |
98 | return (i + 3) & ~3u; | |
99 | } | |
100 | ||
a18c4bc3 | 101 | static void link_init_max_pkt(struct tipc_link *l_ptr) |
b97bf3fd | 102 | { |
7a2f7d18 | 103 | struct tipc_bearer *b_ptr; |
b97bf3fd | 104 | u32 max_pkt; |
c4307285 | 105 | |
7a2f7d18 YX |
106 | rcu_read_lock(); |
107 | b_ptr = rcu_dereference_rtnl(bearer_list[l_ptr->bearer_id]); | |
108 | if (!b_ptr) { | |
109 | rcu_read_unlock(); | |
110 | return; | |
111 | } | |
112 | max_pkt = (b_ptr->mtu & ~3); | |
113 | rcu_read_unlock(); | |
114 | ||
b97bf3fd PL |
115 | if (max_pkt > MAX_MSG_SIZE) |
116 | max_pkt = MAX_MSG_SIZE; | |
117 | ||
c4307285 | 118 | l_ptr->max_pkt_target = max_pkt; |
b97bf3fd PL |
119 | if (l_ptr->max_pkt_target < MAX_PKT_DEFAULT) |
120 | l_ptr->max_pkt = l_ptr->max_pkt_target; | |
c4307285 | 121 | else |
b97bf3fd PL |
122 | l_ptr->max_pkt = MAX_PKT_DEFAULT; |
123 | ||
c4307285 | 124 | l_ptr->max_pkt_probes = 0; |
b97bf3fd PL |
125 | } |
126 | ||
a18c4bc3 | 127 | static u32 link_next_sent(struct tipc_link *l_ptr) |
b97bf3fd PL |
128 | { |
129 | if (l_ptr->next_out) | |
f905730c | 130 | return buf_seqno(l_ptr->next_out); |
b97bf3fd PL |
131 | return mod(l_ptr->next_out_no); |
132 | } | |
133 | ||
a18c4bc3 | 134 | static u32 link_last_sent(struct tipc_link *l_ptr) |
b97bf3fd PL |
135 | { |
136 | return mod(link_next_sent(l_ptr) - 1); | |
137 | } | |
138 | ||
139 | /* | |
05790c64 | 140 | * Simple non-static link routines (i.e. referenced outside this file) |
b97bf3fd | 141 | */ |
a18c4bc3 | 142 | int tipc_link_is_up(struct tipc_link *l_ptr) |
b97bf3fd PL |
143 | { |
144 | if (!l_ptr) | |
145 | return 0; | |
a02cec21 | 146 | return link_working_working(l_ptr) || link_working_unknown(l_ptr); |
b97bf3fd PL |
147 | } |
148 | ||
a18c4bc3 | 149 | int tipc_link_is_active(struct tipc_link *l_ptr) |
b97bf3fd | 150 | { |
a02cec21 ED |
151 | return (l_ptr->owner->active_links[0] == l_ptr) || |
152 | (l_ptr->owner->active_links[1] == l_ptr); | |
b97bf3fd PL |
153 | } |
154 | ||
b97bf3fd PL |
155 | /** |
156 | * link_timeout - handle expiration of link timer | |
157 | * @l_ptr: pointer to link | |
b97bf3fd | 158 | */ |
a18c4bc3 | 159 | static void link_timeout(struct tipc_link *l_ptr) |
b97bf3fd | 160 | { |
4323add6 | 161 | tipc_node_lock(l_ptr->owner); |
b97bf3fd PL |
162 | |
163 | /* update counters used in statistical profiling of send traffic */ | |
b97bf3fd PL |
164 | l_ptr->stats.accu_queue_sz += l_ptr->out_queue_size; |
165 | l_ptr->stats.queue_sz_counts++; | |
166 | ||
b97bf3fd PL |
167 | if (l_ptr->first_out) { |
168 | struct tipc_msg *msg = buf_msg(l_ptr->first_out); | |
169 | u32 length = msg_size(msg); | |
170 | ||
f64f9e71 JP |
171 | if ((msg_user(msg) == MSG_FRAGMENTER) && |
172 | (msg_type(msg) == FIRST_FRAGMENT)) { | |
b97bf3fd PL |
173 | length = msg_size(msg_get_wrapped(msg)); |
174 | } | |
175 | if (length) { | |
176 | l_ptr->stats.msg_lengths_total += length; | |
177 | l_ptr->stats.msg_length_counts++; | |
178 | if (length <= 64) | |
179 | l_ptr->stats.msg_length_profile[0]++; | |
180 | else if (length <= 256) | |
181 | l_ptr->stats.msg_length_profile[1]++; | |
182 | else if (length <= 1024) | |
183 | l_ptr->stats.msg_length_profile[2]++; | |
184 | else if (length <= 4096) | |
185 | l_ptr->stats.msg_length_profile[3]++; | |
186 | else if (length <= 16384) | |
187 | l_ptr->stats.msg_length_profile[4]++; | |
188 | else if (length <= 32768) | |
189 | l_ptr->stats.msg_length_profile[5]++; | |
190 | else | |
191 | l_ptr->stats.msg_length_profile[6]++; | |
192 | } | |
193 | } | |
194 | ||
195 | /* do all other link processing performed on a periodic basis */ | |
b97bf3fd PL |
196 | |
197 | link_state_event(l_ptr, TIMEOUT_EVT); | |
198 | ||
199 | if (l_ptr->next_out) | |
4323add6 | 200 | tipc_link_push_queue(l_ptr); |
b97bf3fd | 201 | |
4323add6 | 202 | tipc_node_unlock(l_ptr->owner); |
b97bf3fd PL |
203 | } |
204 | ||
a18c4bc3 | 205 | static void link_set_timer(struct tipc_link *l_ptr, u32 time) |
b97bf3fd PL |
206 | { |
207 | k_start_timer(&l_ptr->timer, time); | |
208 | } | |
209 | ||
210 | /** | |
4323add6 | 211 | * tipc_link_create - create a new link |
37b9c08a | 212 | * @n_ptr: pointer to associated node |
b97bf3fd | 213 | * @b_ptr: pointer to associated bearer |
b97bf3fd | 214 | * @media_addr: media address to use when sending messages over link |
c4307285 | 215 | * |
b97bf3fd PL |
216 | * Returns pointer to link. |
217 | */ | |
a18c4bc3 | 218 | struct tipc_link *tipc_link_create(struct tipc_node *n_ptr, |
c61dd61d YX |
219 | struct tipc_bearer *b_ptr, |
220 | const struct tipc_media_addr *media_addr) | |
b97bf3fd | 221 | { |
a18c4bc3 | 222 | struct tipc_link *l_ptr; |
b97bf3fd PL |
223 | struct tipc_msg *msg; |
224 | char *if_name; | |
37b9c08a AS |
225 | char addr_string[16]; |
226 | u32 peer = n_ptr->addr; | |
227 | ||
228 | if (n_ptr->link_cnt >= 2) { | |
229 | tipc_addr_string_fill(addr_string, n_ptr->addr); | |
2cf8aa19 | 230 | pr_err("Attempt to establish third link to %s\n", addr_string); |
37b9c08a AS |
231 | return NULL; |
232 | } | |
233 | ||
234 | if (n_ptr->links[b_ptr->identity]) { | |
235 | tipc_addr_string_fill(addr_string, n_ptr->addr); | |
2cf8aa19 EH |
236 | pr_err("Attempt to establish second link on <%s> to %s\n", |
237 | b_ptr->name, addr_string); | |
37b9c08a AS |
238 | return NULL; |
239 | } | |
b97bf3fd | 240 | |
0da974f4 | 241 | l_ptr = kzalloc(sizeof(*l_ptr), GFP_ATOMIC); |
b97bf3fd | 242 | if (!l_ptr) { |
2cf8aa19 | 243 | pr_warn("Link creation failed, no memory\n"); |
b97bf3fd PL |
244 | return NULL; |
245 | } | |
b97bf3fd PL |
246 | |
247 | l_ptr->addr = peer; | |
2d627b92 | 248 | if_name = strchr(b_ptr->name, ':') + 1; |
062b4c99 | 249 | sprintf(l_ptr->name, "%u.%u.%u:%s-%u.%u.%u:unknown", |
b97bf3fd | 250 | tipc_zone(tipc_own_addr), tipc_cluster(tipc_own_addr), |
c4307285 | 251 | tipc_node(tipc_own_addr), |
b97bf3fd PL |
252 | if_name, |
253 | tipc_zone(peer), tipc_cluster(peer), tipc_node(peer)); | |
062b4c99 | 254 | /* note: peer i/f name is updated by reset/activate message */ |
b97bf3fd | 255 | memcpy(&l_ptr->media_addr, media_addr, sizeof(*media_addr)); |
37b9c08a | 256 | l_ptr->owner = n_ptr; |
b97bf3fd | 257 | l_ptr->checkpoint = 1; |
f882cb76 | 258 | l_ptr->peer_session = INVALID_SESSION; |
7a2f7d18 | 259 | l_ptr->bearer_id = b_ptr->identity; |
5c216e1d | 260 | link_set_supervision_props(l_ptr, b_ptr->tolerance); |
b97bf3fd PL |
261 | l_ptr->state = RESET_UNKNOWN; |
262 | ||
263 | l_ptr->pmsg = (struct tipc_msg *)&l_ptr->proto_msg; | |
264 | msg = l_ptr->pmsg; | |
c68ca7b7 | 265 | tipc_msg_init(msg, LINK_PROTOCOL, RESET_MSG, INT_H_SIZE, l_ptr->addr); |
b97bf3fd | 266 | msg_set_size(msg, sizeof(l_ptr->proto_msg)); |
a686e685 | 267 | msg_set_session(msg, (tipc_random & 0xffff)); |
b97bf3fd PL |
268 | msg_set_bearer_id(msg, b_ptr->identity); |
269 | strcpy((char *)msg_data(msg), if_name); | |
270 | ||
271 | l_ptr->priority = b_ptr->priority; | |
5c216e1d | 272 | tipc_link_set_queue_limits(l_ptr, b_ptr->window); |
b97bf3fd | 273 | |
7a2f7d18 | 274 | l_ptr->net_plane = b_ptr->net_plane; |
b97bf3fd PL |
275 | link_init_max_pkt(l_ptr); |
276 | ||
277 | l_ptr->next_out_no = 1; | |
278 | INIT_LIST_HEAD(&l_ptr->waiting_ports); | |
279 | ||
280 | link_reset_statistics(l_ptr); | |
281 | ||
37b9c08a | 282 | tipc_node_attach_link(n_ptr, l_ptr); |
b97bf3fd | 283 | |
170b3927 JPM |
284 | k_init_timer(&l_ptr->timer, (Handler)link_timeout, |
285 | (unsigned long)l_ptr); | |
581465fa JPM |
286 | |
287 | link_state_event(l_ptr, STARTING_EVT); | |
b97bf3fd | 288 | |
b97bf3fd PL |
289 | return l_ptr; |
290 | } | |
291 | ||
7d33939f | 292 | void tipc_link_delete_list(unsigned int bearer_id, bool shutting_down) |
8d8439b6 YX |
293 | { |
294 | struct tipc_link *l_ptr; | |
c61dd61d | 295 | struct tipc_node *n_ptr; |
8d8439b6 | 296 | |
6c7a762e YX |
297 | rcu_read_lock(); |
298 | list_for_each_entry_rcu(n_ptr, &tipc_node_list, list) { | |
5356f3d7 | 299 | tipc_node_lock(n_ptr); |
c61dd61d YX |
300 | l_ptr = n_ptr->links[bearer_id]; |
301 | if (l_ptr) { | |
302 | tipc_link_reset(l_ptr); | |
7d33939f JPM |
303 | if (shutting_down || !tipc_node_is_up(n_ptr)) { |
304 | tipc_node_detach_link(l_ptr->owner, l_ptr); | |
305 | tipc_link_reset_fragments(l_ptr); | |
5356f3d7 | 306 | tipc_node_unlock(n_ptr); |
7d33939f JPM |
307 | |
308 | /* Nobody else can access this link now: */ | |
309 | del_timer_sync(&l_ptr->timer); | |
310 | kfree(l_ptr); | |
311 | } else { | |
312 | /* Detach/delete when failover is finished: */ | |
313 | l_ptr->flags |= LINK_STOPPED; | |
5356f3d7 | 314 | tipc_node_unlock(n_ptr); |
7d33939f JPM |
315 | del_timer_sync(&l_ptr->timer); |
316 | } | |
c61dd61d YX |
317 | continue; |
318 | } | |
5356f3d7 | 319 | tipc_node_unlock(n_ptr); |
8d8439b6 | 320 | } |
6c7a762e | 321 | rcu_read_unlock(); |
8d8439b6 | 322 | } |
b97bf3fd PL |
323 | |
324 | /** | |
c4307285 | 325 | * link_schedule_port - schedule port for deferred sending |
b97bf3fd PL |
326 | * @l_ptr: pointer to link |
327 | * @origport: reference to sending port | |
328 | * @sz: amount of data to be sent | |
c4307285 YH |
329 | * |
330 | * Schedules port for renewed sending of messages after link congestion | |
b97bf3fd PL |
331 | * has abated. |
332 | */ | |
a18c4bc3 | 333 | static int link_schedule_port(struct tipc_link *l_ptr, u32 origport, u32 sz) |
b97bf3fd | 334 | { |
23dd4cce | 335 | struct tipc_port *p_ptr; |
60120526 | 336 | struct tipc_sock *tsk; |
b97bf3fd | 337 | |
4323add6 PL |
338 | spin_lock_bh(&tipc_port_list_lock); |
339 | p_ptr = tipc_port_lock(origport); | |
b97bf3fd | 340 | if (p_ptr) { |
b97bf3fd PL |
341 | if (!list_empty(&p_ptr->wait_list)) |
342 | goto exit; | |
60120526 JPM |
343 | tsk = tipc_port_to_sock(p_ptr); |
344 | tsk->link_cong = 1; | |
15e979da | 345 | p_ptr->waiting_pkts = 1 + ((sz - 1) / l_ptr->max_pkt); |
b97bf3fd PL |
346 | list_add_tail(&p_ptr->wait_list, &l_ptr->waiting_ports); |
347 | l_ptr->stats.link_congs++; | |
348 | exit: | |
4323add6 | 349 | tipc_port_unlock(p_ptr); |
b97bf3fd | 350 | } |
4323add6 | 351 | spin_unlock_bh(&tipc_port_list_lock); |
b97bf3fd PL |
352 | return -ELINKCONG; |
353 | } | |
354 | ||
a18c4bc3 | 355 | void tipc_link_wakeup_ports(struct tipc_link *l_ptr, int all) |
b97bf3fd | 356 | { |
23dd4cce | 357 | struct tipc_port *p_ptr; |
60120526 | 358 | struct tipc_sock *tsk; |
23dd4cce | 359 | struct tipc_port *temp_p_ptr; |
b97bf3fd PL |
360 | int win = l_ptr->queue_limit[0] - l_ptr->out_queue_size; |
361 | ||
362 | if (all) | |
363 | win = 100000; | |
364 | if (win <= 0) | |
365 | return; | |
4323add6 | 366 | if (!spin_trylock_bh(&tipc_port_list_lock)) |
b97bf3fd PL |
367 | return; |
368 | if (link_congested(l_ptr)) | |
369 | goto exit; | |
c4307285 | 370 | list_for_each_entry_safe(p_ptr, temp_p_ptr, &l_ptr->waiting_ports, |
b97bf3fd PL |
371 | wait_list) { |
372 | if (win <= 0) | |
373 | break; | |
60120526 | 374 | tsk = tipc_port_to_sock(p_ptr); |
b97bf3fd | 375 | list_del_init(&p_ptr->wait_list); |
23dd4cce | 376 | spin_lock_bh(p_ptr->lock); |
60120526 JPM |
377 | tsk->link_cong = 0; |
378 | tipc_sock_wakeup(tsk); | |
b97bf3fd | 379 | win -= p_ptr->waiting_pkts; |
23dd4cce | 380 | spin_unlock_bh(p_ptr->lock); |
b97bf3fd PL |
381 | } |
382 | ||
383 | exit: | |
4323add6 | 384 | spin_unlock_bh(&tipc_port_list_lock); |
b97bf3fd PL |
385 | } |
386 | ||
c4307285 | 387 | /** |
b97bf3fd PL |
388 | * link_release_outqueue - purge link's outbound message queue |
389 | * @l_ptr: pointer to link | |
390 | */ | |
a18c4bc3 | 391 | static void link_release_outqueue(struct tipc_link *l_ptr) |
b97bf3fd | 392 | { |
d77b3831 | 393 | kfree_skb_list(l_ptr->first_out); |
b97bf3fd PL |
394 | l_ptr->first_out = NULL; |
395 | l_ptr->out_queue_size = 0; | |
396 | } | |
397 | ||
398 | /** | |
4323add6 | 399 | * tipc_link_reset_fragments - purge link's inbound message fragments queue |
b97bf3fd PL |
400 | * @l_ptr: pointer to link |
401 | */ | |
a18c4bc3 | 402 | void tipc_link_reset_fragments(struct tipc_link *l_ptr) |
b97bf3fd | 403 | { |
37e22164 JPM |
404 | kfree_skb(l_ptr->reasm_buf); |
405 | l_ptr->reasm_buf = NULL; | |
b97bf3fd PL |
406 | } |
407 | ||
c4307285 | 408 | /** |
581465fa | 409 | * tipc_link_purge_queues - purge all pkt queues associated with link |
b97bf3fd PL |
410 | * @l_ptr: pointer to link |
411 | */ | |
581465fa | 412 | void tipc_link_purge_queues(struct tipc_link *l_ptr) |
b97bf3fd | 413 | { |
d77b3831 YX |
414 | kfree_skb_list(l_ptr->oldest_deferred_in); |
415 | kfree_skb_list(l_ptr->first_out); | |
4323add6 | 416 | tipc_link_reset_fragments(l_ptr); |
5f6d9123 | 417 | kfree_skb(l_ptr->proto_msg_queue); |
b97bf3fd PL |
418 | l_ptr->proto_msg_queue = NULL; |
419 | } | |
420 | ||
a18c4bc3 | 421 | void tipc_link_reset(struct tipc_link *l_ptr) |
b97bf3fd | 422 | { |
b97bf3fd PL |
423 | u32 prev_state = l_ptr->state; |
424 | u32 checkpoint = l_ptr->next_in_no; | |
5392d646 | 425 | int was_active_link = tipc_link_is_active(l_ptr); |
c4307285 | 426 | |
a686e685 | 427 | msg_set_session(l_ptr->pmsg, ((msg_session(l_ptr->pmsg) + 1) & 0xffff)); |
b97bf3fd | 428 | |
a686e685 AS |
429 | /* Link is down, accept any session */ |
430 | l_ptr->peer_session = INVALID_SESSION; | |
b97bf3fd | 431 | |
c4307285 | 432 | /* Prepare for max packet size negotiation */ |
b97bf3fd | 433 | link_init_max_pkt(l_ptr); |
c4307285 | 434 | |
b97bf3fd | 435 | l_ptr->state = RESET_UNKNOWN; |
b97bf3fd PL |
436 | |
437 | if ((prev_state == RESET_UNKNOWN) || (prev_state == RESET_RESET)) | |
438 | return; | |
439 | ||
4323add6 | 440 | tipc_node_link_down(l_ptr->owner, l_ptr); |
7a2f7d18 | 441 | tipc_bearer_remove_dest(l_ptr->bearer_id, l_ptr->addr); |
7368ddf1 | 442 | |
b9d4c339 | 443 | if (was_active_link && tipc_node_active_links(l_ptr->owner)) { |
b97bf3fd PL |
444 | l_ptr->reset_checkpoint = checkpoint; |
445 | l_ptr->exp_msg_count = START_CHANGEOVER; | |
446 | } | |
447 | ||
448 | /* Clean up all queues: */ | |
b97bf3fd | 449 | link_release_outqueue(l_ptr); |
5f6d9123 | 450 | kfree_skb(l_ptr->proto_msg_queue); |
b97bf3fd | 451 | l_ptr->proto_msg_queue = NULL; |
d77b3831 | 452 | kfree_skb_list(l_ptr->oldest_deferred_in); |
b97bf3fd | 453 | if (!list_empty(&l_ptr->waiting_ports)) |
4323add6 | 454 | tipc_link_wakeup_ports(l_ptr, 1); |
b97bf3fd PL |
455 | |
456 | l_ptr->retransm_queue_head = 0; | |
457 | l_ptr->retransm_queue_size = 0; | |
458 | l_ptr->last_out = NULL; | |
459 | l_ptr->first_out = NULL; | |
460 | l_ptr->next_out = NULL; | |
461 | l_ptr->unacked_window = 0; | |
462 | l_ptr->checkpoint = 1; | |
463 | l_ptr->next_out_no = 1; | |
464 | l_ptr->deferred_inqueue_sz = 0; | |
465 | l_ptr->oldest_deferred_in = NULL; | |
466 | l_ptr->newest_deferred_in = NULL; | |
467 | l_ptr->fsm_msg_cnt = 0; | |
468 | l_ptr->stale_count = 0; | |
469 | link_reset_statistics(l_ptr); | |
b97bf3fd PL |
470 | } |
471 | ||
c61dd61d | 472 | void tipc_link_reset_list(unsigned int bearer_id) |
e0ca2c30 YX |
473 | { |
474 | struct tipc_link *l_ptr; | |
c61dd61d | 475 | struct tipc_node *n_ptr; |
e0ca2c30 | 476 | |
6c7a762e YX |
477 | rcu_read_lock(); |
478 | list_for_each_entry_rcu(n_ptr, &tipc_node_list, list) { | |
5356f3d7 | 479 | tipc_node_lock(n_ptr); |
c61dd61d YX |
480 | l_ptr = n_ptr->links[bearer_id]; |
481 | if (l_ptr) | |
482 | tipc_link_reset(l_ptr); | |
5356f3d7 | 483 | tipc_node_unlock(n_ptr); |
e0ca2c30 | 484 | } |
6c7a762e | 485 | rcu_read_unlock(); |
e0ca2c30 | 486 | } |
b97bf3fd | 487 | |
a18c4bc3 | 488 | static void link_activate(struct tipc_link *l_ptr) |
b97bf3fd | 489 | { |
5392d646 | 490 | l_ptr->next_in_no = l_ptr->stats.recv_info = 1; |
4323add6 | 491 | tipc_node_link_up(l_ptr->owner, l_ptr); |
7a2f7d18 | 492 | tipc_bearer_add_dest(l_ptr->bearer_id, l_ptr->addr); |
b97bf3fd PL |
493 | } |
494 | ||
495 | /** | |
496 | * link_state_event - link finite state machine | |
497 | * @l_ptr: pointer to link | |
498 | * @event: state machine event to process | |
499 | */ | |
95c96174 | 500 | static void link_state_event(struct tipc_link *l_ptr, unsigned int event) |
b97bf3fd | 501 | { |
a18c4bc3 | 502 | struct tipc_link *other; |
b97bf3fd PL |
503 | u32 cont_intv = l_ptr->continuity_interval; |
504 | ||
7d33939f JPM |
505 | if (l_ptr->flags & LINK_STOPPED) |
506 | return; | |
507 | ||
135daee6 | 508 | if (!(l_ptr->flags & LINK_STARTED) && (event != STARTING_EVT)) |
b97bf3fd PL |
509 | return; /* Not yet. */ |
510 | ||
77a7e07a YX |
511 | /* Check whether changeover is going on */ |
512 | if (l_ptr->exp_msg_count) { | |
a016892c | 513 | if (event == TIMEOUT_EVT) |
b97bf3fd | 514 | link_set_timer(l_ptr, cont_intv); |
77a7e07a | 515 | return; |
b97bf3fd | 516 | } |
b97bf3fd PL |
517 | |
518 | switch (l_ptr->state) { | |
519 | case WORKING_WORKING: | |
b97bf3fd PL |
520 | switch (event) { |
521 | case TRAFFIC_MSG_EVT: | |
b97bf3fd | 522 | case ACTIVATE_MSG: |
b97bf3fd PL |
523 | break; |
524 | case TIMEOUT_EVT: | |
b97bf3fd PL |
525 | if (l_ptr->next_in_no != l_ptr->checkpoint) { |
526 | l_ptr->checkpoint = l_ptr->next_in_no; | |
4323add6 | 527 | if (tipc_bclink_acks_missing(l_ptr->owner)) { |
247f0f3c YX |
528 | tipc_link_proto_xmit(l_ptr, STATE_MSG, |
529 | 0, 0, 0, 0, 0); | |
b97bf3fd PL |
530 | l_ptr->fsm_msg_cnt++; |
531 | } else if (l_ptr->max_pkt < l_ptr->max_pkt_target) { | |
247f0f3c YX |
532 | tipc_link_proto_xmit(l_ptr, STATE_MSG, |
533 | 1, 0, 0, 0, 0); | |
b97bf3fd PL |
534 | l_ptr->fsm_msg_cnt++; |
535 | } | |
536 | link_set_timer(l_ptr, cont_intv); | |
537 | break; | |
538 | } | |
b97bf3fd PL |
539 | l_ptr->state = WORKING_UNKNOWN; |
540 | l_ptr->fsm_msg_cnt = 0; | |
247f0f3c | 541 | tipc_link_proto_xmit(l_ptr, STATE_MSG, 1, 0, 0, 0, 0); |
b97bf3fd PL |
542 | l_ptr->fsm_msg_cnt++; |
543 | link_set_timer(l_ptr, cont_intv / 4); | |
544 | break; | |
545 | case RESET_MSG: | |
2cf8aa19 EH |
546 | pr_info("%s<%s>, requested by peer\n", link_rst_msg, |
547 | l_ptr->name); | |
4323add6 | 548 | tipc_link_reset(l_ptr); |
b97bf3fd PL |
549 | l_ptr->state = RESET_RESET; |
550 | l_ptr->fsm_msg_cnt = 0; | |
247f0f3c YX |
551 | tipc_link_proto_xmit(l_ptr, ACTIVATE_MSG, |
552 | 0, 0, 0, 0, 0); | |
b97bf3fd PL |
553 | l_ptr->fsm_msg_cnt++; |
554 | link_set_timer(l_ptr, cont_intv); | |
555 | break; | |
556 | default: | |
2cf8aa19 | 557 | pr_err("%s%u in WW state\n", link_unk_evt, event); |
b97bf3fd PL |
558 | } |
559 | break; | |
560 | case WORKING_UNKNOWN: | |
b97bf3fd PL |
561 | switch (event) { |
562 | case TRAFFIC_MSG_EVT: | |
b97bf3fd | 563 | case ACTIVATE_MSG: |
b97bf3fd PL |
564 | l_ptr->state = WORKING_WORKING; |
565 | l_ptr->fsm_msg_cnt = 0; | |
566 | link_set_timer(l_ptr, cont_intv); | |
567 | break; | |
568 | case RESET_MSG: | |
2cf8aa19 EH |
569 | pr_info("%s<%s>, requested by peer while probing\n", |
570 | link_rst_msg, l_ptr->name); | |
4323add6 | 571 | tipc_link_reset(l_ptr); |
b97bf3fd PL |
572 | l_ptr->state = RESET_RESET; |
573 | l_ptr->fsm_msg_cnt = 0; | |
247f0f3c YX |
574 | tipc_link_proto_xmit(l_ptr, ACTIVATE_MSG, |
575 | 0, 0, 0, 0, 0); | |
b97bf3fd PL |
576 | l_ptr->fsm_msg_cnt++; |
577 | link_set_timer(l_ptr, cont_intv); | |
578 | break; | |
579 | case TIMEOUT_EVT: | |
b97bf3fd | 580 | if (l_ptr->next_in_no != l_ptr->checkpoint) { |
b97bf3fd PL |
581 | l_ptr->state = WORKING_WORKING; |
582 | l_ptr->fsm_msg_cnt = 0; | |
583 | l_ptr->checkpoint = l_ptr->next_in_no; | |
4323add6 | 584 | if (tipc_bclink_acks_missing(l_ptr->owner)) { |
247f0f3c YX |
585 | tipc_link_proto_xmit(l_ptr, STATE_MSG, |
586 | 0, 0, 0, 0, 0); | |
b97bf3fd PL |
587 | l_ptr->fsm_msg_cnt++; |
588 | } | |
589 | link_set_timer(l_ptr, cont_intv); | |
590 | } else if (l_ptr->fsm_msg_cnt < l_ptr->abort_limit) { | |
247f0f3c YX |
591 | tipc_link_proto_xmit(l_ptr, STATE_MSG, |
592 | 1, 0, 0, 0, 0); | |
b97bf3fd PL |
593 | l_ptr->fsm_msg_cnt++; |
594 | link_set_timer(l_ptr, cont_intv / 4); | |
595 | } else { /* Link has failed */ | |
2cf8aa19 EH |
596 | pr_warn("%s<%s>, peer not responding\n", |
597 | link_rst_msg, l_ptr->name); | |
4323add6 | 598 | tipc_link_reset(l_ptr); |
b97bf3fd PL |
599 | l_ptr->state = RESET_UNKNOWN; |
600 | l_ptr->fsm_msg_cnt = 0; | |
247f0f3c YX |
601 | tipc_link_proto_xmit(l_ptr, RESET_MSG, |
602 | 0, 0, 0, 0, 0); | |
b97bf3fd PL |
603 | l_ptr->fsm_msg_cnt++; |
604 | link_set_timer(l_ptr, cont_intv); | |
605 | } | |
606 | break; | |
607 | default: | |
2cf8aa19 | 608 | pr_err("%s%u in WU state\n", link_unk_evt, event); |
b97bf3fd PL |
609 | } |
610 | break; | |
611 | case RESET_UNKNOWN: | |
b97bf3fd PL |
612 | switch (event) { |
613 | case TRAFFIC_MSG_EVT: | |
b97bf3fd PL |
614 | break; |
615 | case ACTIVATE_MSG: | |
616 | other = l_ptr->owner->active_links[0]; | |
8d64a5ba | 617 | if (other && link_working_unknown(other)) |
b97bf3fd | 618 | break; |
b97bf3fd PL |
619 | l_ptr->state = WORKING_WORKING; |
620 | l_ptr->fsm_msg_cnt = 0; | |
621 | link_activate(l_ptr); | |
247f0f3c | 622 | tipc_link_proto_xmit(l_ptr, STATE_MSG, 1, 0, 0, 0, 0); |
b97bf3fd | 623 | l_ptr->fsm_msg_cnt++; |
c64f7a6a | 624 | if (l_ptr->owner->working_links == 1) |
247f0f3c | 625 | tipc_link_sync_xmit(l_ptr); |
b97bf3fd PL |
626 | link_set_timer(l_ptr, cont_intv); |
627 | break; | |
628 | case RESET_MSG: | |
b97bf3fd PL |
629 | l_ptr->state = RESET_RESET; |
630 | l_ptr->fsm_msg_cnt = 0; | |
247f0f3c YX |
631 | tipc_link_proto_xmit(l_ptr, ACTIVATE_MSG, |
632 | 1, 0, 0, 0, 0); | |
b97bf3fd PL |
633 | l_ptr->fsm_msg_cnt++; |
634 | link_set_timer(l_ptr, cont_intv); | |
635 | break; | |
636 | case STARTING_EVT: | |
135daee6 | 637 | l_ptr->flags |= LINK_STARTED; |
b97bf3fd PL |
638 | /* fall through */ |
639 | case TIMEOUT_EVT: | |
247f0f3c | 640 | tipc_link_proto_xmit(l_ptr, RESET_MSG, 0, 0, 0, 0, 0); |
b97bf3fd PL |
641 | l_ptr->fsm_msg_cnt++; |
642 | link_set_timer(l_ptr, cont_intv); | |
643 | break; | |
644 | default: | |
2cf8aa19 | 645 | pr_err("%s%u in RU state\n", link_unk_evt, event); |
b97bf3fd PL |
646 | } |
647 | break; | |
648 | case RESET_RESET: | |
b97bf3fd PL |
649 | switch (event) { |
650 | case TRAFFIC_MSG_EVT: | |
b97bf3fd PL |
651 | case ACTIVATE_MSG: |
652 | other = l_ptr->owner->active_links[0]; | |
8d64a5ba | 653 | if (other && link_working_unknown(other)) |
b97bf3fd | 654 | break; |
b97bf3fd PL |
655 | l_ptr->state = WORKING_WORKING; |
656 | l_ptr->fsm_msg_cnt = 0; | |
657 | link_activate(l_ptr); | |
247f0f3c | 658 | tipc_link_proto_xmit(l_ptr, STATE_MSG, 1, 0, 0, 0, 0); |
b97bf3fd | 659 | l_ptr->fsm_msg_cnt++; |
c64f7a6a | 660 | if (l_ptr->owner->working_links == 1) |
247f0f3c | 661 | tipc_link_sync_xmit(l_ptr); |
b97bf3fd PL |
662 | link_set_timer(l_ptr, cont_intv); |
663 | break; | |
664 | case RESET_MSG: | |
b97bf3fd PL |
665 | break; |
666 | case TIMEOUT_EVT: | |
247f0f3c YX |
667 | tipc_link_proto_xmit(l_ptr, ACTIVATE_MSG, |
668 | 0, 0, 0, 0, 0); | |
b97bf3fd PL |
669 | l_ptr->fsm_msg_cnt++; |
670 | link_set_timer(l_ptr, cont_intv); | |
b97bf3fd PL |
671 | break; |
672 | default: | |
2cf8aa19 | 673 | pr_err("%s%u in RR state\n", link_unk_evt, event); |
b97bf3fd PL |
674 | } |
675 | break; | |
676 | default: | |
2cf8aa19 | 677 | pr_err("Unknown link state %u/%u\n", l_ptr->state, event); |
b97bf3fd PL |
678 | } |
679 | } | |
680 | ||
4f1688b2 JPM |
681 | /* tipc_link_cong: determine return value and how to treat the |
682 | * sent buffer during link congestion. | |
683 | * - For plain, errorless user data messages we keep the buffer and | |
684 | * return -ELINKONG. | |
685 | * - For all other messages we discard the buffer and return -EHOSTUNREACH | |
686 | * - For TIPC internal messages we also reset the link | |
687 | */ | |
688 | static int tipc_link_cong(struct tipc_link *link, struct sk_buff *buf) | |
689 | { | |
690 | struct tipc_msg *msg = buf_msg(buf); | |
691 | uint psz = msg_size(msg); | |
692 | uint imp = tipc_msg_tot_importance(msg); | |
693 | u32 oport = msg_tot_origport(msg); | |
694 | ||
695 | if (likely(imp <= TIPC_CRITICAL_IMPORTANCE)) { | |
696 | if (!msg_errcode(msg) && !msg_reroute_cnt(msg)) { | |
697 | link_schedule_port(link, oport, psz); | |
698 | return -ELINKCONG; | |
699 | } | |
700 | } else { | |
701 | pr_warn("%s<%s>, send queue full", link_rst_msg, link->name); | |
702 | tipc_link_reset(link); | |
703 | } | |
704 | kfree_skb_list(buf); | |
705 | return -EHOSTUNREACH; | |
706 | } | |
707 | ||
708 | /** | |
9fbfb8b1 | 709 | * __tipc_link_xmit(): same as tipc_link_xmit, but destlink is known & locked |
4f1688b2 JPM |
710 | * @link: link to use |
711 | * @buf: chain of buffers containing message | |
712 | * Consumes the buffer chain, except when returning -ELINKCONG | |
713 | * Returns 0 if success, otherwise errno: -ELINKCONG, -EMSGSIZE (plain socket | |
714 | * user data messages) or -EHOSTUNREACH (all other messages/senders) | |
715 | * Only the socket functions tipc_send_stream() and tipc_send_packet() need | |
716 | * to act on the return value, since they may need to do more send attempts. | |
717 | */ | |
9fbfb8b1 | 718 | int __tipc_link_xmit(struct tipc_link *link, struct sk_buff *buf) |
4f1688b2 JPM |
719 | { |
720 | struct tipc_msg *msg = buf_msg(buf); | |
721 | uint psz = msg_size(msg); | |
722 | uint qsz = link->out_queue_size; | |
723 | uint sndlim = link->queue_limit[0]; | |
724 | uint imp = tipc_msg_tot_importance(msg); | |
725 | uint mtu = link->max_pkt; | |
726 | uint ack = mod(link->next_in_no - 1); | |
727 | uint seqno = link->next_out_no; | |
728 | uint bc_last_in = link->owner->bclink.last_in; | |
729 | struct tipc_media_addr *addr = &link->media_addr; | |
730 | struct sk_buff *next = buf->next; | |
731 | ||
732 | /* Match queue limits against msg importance: */ | |
733 | if (unlikely(qsz >= link->queue_limit[imp])) | |
734 | return tipc_link_cong(link, buf); | |
735 | ||
736 | /* Has valid packet limit been used ? */ | |
737 | if (unlikely(psz > mtu)) { | |
738 | kfree_skb_list(buf); | |
739 | return -EMSGSIZE; | |
740 | } | |
741 | ||
742 | /* Prepare each packet for sending, and add to outqueue: */ | |
743 | while (buf) { | |
744 | next = buf->next; | |
745 | msg = buf_msg(buf); | |
746 | msg_set_word(msg, 2, ((ack << 16) | mod(seqno))); | |
747 | msg_set_bcast_ack(msg, bc_last_in); | |
748 | ||
749 | if (!link->first_out) { | |
750 | link->first_out = buf; | |
751 | } else if (qsz < sndlim) { | |
752 | link->last_out->next = buf; | |
753 | } else if (tipc_msg_bundle(link->last_out, buf, mtu)) { | |
754 | link->stats.sent_bundled++; | |
755 | buf = next; | |
756 | next = buf->next; | |
757 | continue; | |
758 | } else if (tipc_msg_make_bundle(&buf, mtu, link->addr)) { | |
759 | link->stats.sent_bundled++; | |
760 | link->stats.sent_bundles++; | |
761 | link->last_out->next = buf; | |
762 | if (!link->next_out) | |
763 | link->next_out = buf; | |
764 | } else { | |
765 | link->last_out->next = buf; | |
766 | if (!link->next_out) | |
767 | link->next_out = buf; | |
768 | } | |
769 | ||
770 | /* Send packet if possible: */ | |
771 | if (likely(++qsz <= sndlim)) { | |
772 | tipc_bearer_send(link->bearer_id, buf, addr); | |
773 | link->next_out = next; | |
774 | link->unacked_window = 0; | |
775 | } | |
776 | seqno++; | |
777 | link->last_out = buf; | |
778 | buf = next; | |
779 | } | |
780 | link->next_out_no = seqno; | |
781 | link->out_queue_size = qsz; | |
782 | return 0; | |
783 | } | |
784 | ||
785 | /** | |
9fbfb8b1 | 786 | * tipc_link_xmit() is the general link level function for message sending |
4f1688b2 JPM |
787 | * @buf: chain of buffers containing message |
788 | * @dsz: amount of user data to be sent | |
789 | * @dnode: address of destination node | |
790 | * @selector: a number used for deterministic link selection | |
791 | * Consumes the buffer chain, except when returning -ELINKCONG | |
792 | * Returns 0 if success, otherwise errno: -ELINKCONG,-EHOSTUNREACH,-EMSGSIZE | |
793 | */ | |
9fbfb8b1 | 794 | int tipc_link_xmit(struct sk_buff *buf, u32 dnode, u32 selector) |
4f1688b2 JPM |
795 | { |
796 | struct tipc_link *link = NULL; | |
797 | struct tipc_node *node; | |
798 | int rc = -EHOSTUNREACH; | |
799 | ||
800 | node = tipc_node_find(dnode); | |
801 | if (node) { | |
802 | tipc_node_lock(node); | |
803 | link = node->active_links[selector & 1]; | |
804 | if (link) | |
9fbfb8b1 | 805 | rc = __tipc_link_xmit(link, buf); |
4f1688b2 JPM |
806 | tipc_node_unlock(node); |
807 | } | |
808 | ||
809 | if (link) | |
810 | return rc; | |
811 | ||
812 | if (likely(in_own_node(dnode))) | |
813 | return tipc_sk_rcv(buf); | |
814 | ||
815 | kfree_skb_list(buf); | |
816 | return rc; | |
817 | } | |
818 | ||
c64f7a6a | 819 | /* |
247f0f3c | 820 | * tipc_link_sync_xmit - synchronize broadcast link endpoints. |
c64f7a6a JM |
821 | * |
822 | * Give a newly added peer node the sequence number where it should | |
823 | * start receiving and acking broadcast packets. | |
824 | * | |
825 | * Called with node locked | |
826 | */ | |
25b660c7 | 827 | static void tipc_link_sync_xmit(struct tipc_link *link) |
c64f7a6a JM |
828 | { |
829 | struct sk_buff *buf; | |
830 | struct tipc_msg *msg; | |
831 | ||
832 | buf = tipc_buf_acquire(INT_H_SIZE); | |
833 | if (!buf) | |
834 | return; | |
835 | ||
836 | msg = buf_msg(buf); | |
25b660c7 JPM |
837 | tipc_msg_init(msg, BCAST_PROTOCOL, STATE_MSG, INT_H_SIZE, link->addr); |
838 | msg_set_last_bcast(msg, link->owner->bclink.acked); | |
9fbfb8b1 | 839 | __tipc_link_xmit(link, buf); |
c64f7a6a JM |
840 | } |
841 | ||
842 | /* | |
247f0f3c | 843 | * tipc_link_sync_rcv - synchronize broadcast link endpoints. |
c64f7a6a JM |
844 | * Receive the sequence number where we should start receiving and |
845 | * acking broadcast packets from a newly added peer node, and open | |
846 | * up for reception of such packets. | |
847 | * | |
848 | * Called with node locked | |
849 | */ | |
247f0f3c | 850 | static void tipc_link_sync_rcv(struct tipc_node *n, struct sk_buff *buf) |
c64f7a6a JM |
851 | { |
852 | struct tipc_msg *msg = buf_msg(buf); | |
853 | ||
854 | n->bclink.last_sent = n->bclink.last_in = msg_last_bcast(msg); | |
855 | n->bclink.recv_permitted = true; | |
856 | kfree_skb(buf); | |
857 | } | |
858 | ||
c4307285 | 859 | /* |
4323add6 | 860 | * tipc_link_push_packet: Push one unsent packet to the media |
b97bf3fd | 861 | */ |
98056963 | 862 | static u32 tipc_link_push_packet(struct tipc_link *l_ptr) |
b97bf3fd PL |
863 | { |
864 | struct sk_buff *buf = l_ptr->first_out; | |
865 | u32 r_q_size = l_ptr->retransm_queue_size; | |
866 | u32 r_q_head = l_ptr->retransm_queue_head; | |
867 | ||
868 | /* Step to position where retransmission failed, if any, */ | |
869 | /* consider that buffers may have been released in meantime */ | |
b97bf3fd | 870 | if (r_q_size && buf) { |
c4307285 | 871 | u32 last = lesser(mod(r_q_head + r_q_size), |
b97bf3fd | 872 | link_last_sent(l_ptr)); |
f905730c | 873 | u32 first = buf_seqno(buf); |
b97bf3fd PL |
874 | |
875 | while (buf && less(first, r_q_head)) { | |
876 | first = mod(first + 1); | |
877 | buf = buf->next; | |
878 | } | |
879 | l_ptr->retransm_queue_head = r_q_head = first; | |
880 | l_ptr->retransm_queue_size = r_q_size = mod(last - first); | |
881 | } | |
882 | ||
883 | /* Continue retransmission now, if there is anything: */ | |
ca509101 | 884 | if (r_q_size && buf) { |
b97bf3fd | 885 | msg_set_ack(buf_msg(buf), mod(l_ptr->next_in_no - 1)); |
c4307285 | 886 | msg_set_bcast_ack(buf_msg(buf), l_ptr->owner->bclink.last_in); |
7a2f7d18 | 887 | tipc_bearer_send(l_ptr->bearer_id, buf, &l_ptr->media_addr); |
3c294cb3 YX |
888 | l_ptr->retransm_queue_head = mod(++r_q_head); |
889 | l_ptr->retransm_queue_size = --r_q_size; | |
890 | l_ptr->stats.retransmitted++; | |
891 | return 0; | |
b97bf3fd PL |
892 | } |
893 | ||
894 | /* Send deferred protocol message, if any: */ | |
b97bf3fd PL |
895 | buf = l_ptr->proto_msg_queue; |
896 | if (buf) { | |
897 | msg_set_ack(buf_msg(buf), mod(l_ptr->next_in_no - 1)); | |
0e65967e | 898 | msg_set_bcast_ack(buf_msg(buf), l_ptr->owner->bclink.last_in); |
7a2f7d18 | 899 | tipc_bearer_send(l_ptr->bearer_id, buf, &l_ptr->media_addr); |
3c294cb3 YX |
900 | l_ptr->unacked_window = 0; |
901 | kfree_skb(buf); | |
902 | l_ptr->proto_msg_queue = NULL; | |
903 | return 0; | |
b97bf3fd PL |
904 | } |
905 | ||
906 | /* Send one deferred data message, if send window not full: */ | |
b97bf3fd PL |
907 | buf = l_ptr->next_out; |
908 | if (buf) { | |
909 | struct tipc_msg *msg = buf_msg(buf); | |
910 | u32 next = msg_seqno(msg); | |
f905730c | 911 | u32 first = buf_seqno(l_ptr->first_out); |
b97bf3fd PL |
912 | |
913 | if (mod(next - first) < l_ptr->queue_limit[0]) { | |
914 | msg_set_ack(msg, mod(l_ptr->next_in_no - 1)); | |
c4307285 | 915 | msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in); |
7a2f7d18 YX |
916 | tipc_bearer_send(l_ptr->bearer_id, buf, |
917 | &l_ptr->media_addr); | |
3c294cb3 | 918 | if (msg_user(msg) == MSG_BUNDLER) |
4f1688b2 | 919 | msg_set_type(msg, BUNDLE_CLOSED); |
3c294cb3 YX |
920 | l_ptr->next_out = buf->next; |
921 | return 0; | |
b97bf3fd PL |
922 | } |
923 | } | |
3c294cb3 | 924 | return 1; |
b97bf3fd PL |
925 | } |
926 | ||
927 | /* | |
928 | * push_queue(): push out the unsent messages of a link where | |
929 | * congestion has abated. Node is locked | |
930 | */ | |
a18c4bc3 | 931 | void tipc_link_push_queue(struct tipc_link *l_ptr) |
b97bf3fd PL |
932 | { |
933 | u32 res; | |
934 | ||
b97bf3fd | 935 | do { |
4323add6 | 936 | res = tipc_link_push_packet(l_ptr); |
0e35fd5e | 937 | } while (!res); |
b97bf3fd PL |
938 | } |
939 | ||
3f5a12bd | 940 | void tipc_link_reset_all(struct tipc_node *node) |
d356eeba | 941 | { |
d356eeba AS |
942 | char addr_string[16]; |
943 | u32 i; | |
944 | ||
3f5a12bd | 945 | tipc_node_lock(node); |
d356eeba | 946 | |
2cf8aa19 | 947 | pr_warn("Resetting all links to %s\n", |
3f5a12bd | 948 | tipc_addr_string_fill(addr_string, node->addr)); |
d356eeba AS |
949 | |
950 | for (i = 0; i < MAX_BEARERS; i++) { | |
3f5a12bd YX |
951 | if (node->links[i]) { |
952 | link_print(node->links[i], "Resetting link\n"); | |
953 | tipc_link_reset(node->links[i]); | |
d356eeba AS |
954 | } |
955 | } | |
956 | ||
3f5a12bd | 957 | tipc_node_unlock(node); |
d356eeba AS |
958 | } |
959 | ||
a18c4bc3 | 960 | static void link_retransmit_failure(struct tipc_link *l_ptr, |
ae8509c4 | 961 | struct sk_buff *buf) |
d356eeba AS |
962 | { |
963 | struct tipc_msg *msg = buf_msg(buf); | |
964 | ||
2cf8aa19 | 965 | pr_warn("Retransmission failure on link <%s>\n", l_ptr->name); |
d356eeba AS |
966 | |
967 | if (l_ptr->addr) { | |
d356eeba | 968 | /* Handle failure on standard link */ |
8d64a5ba | 969 | link_print(l_ptr, "Resetting link\n"); |
d356eeba AS |
970 | tipc_link_reset(l_ptr); |
971 | ||
972 | } else { | |
d356eeba | 973 | /* Handle failure on broadcast link */ |
6c00055a | 974 | struct tipc_node *n_ptr; |
d356eeba AS |
975 | char addr_string[16]; |
976 | ||
2cf8aa19 EH |
977 | pr_info("Msg seq number: %u, ", msg_seqno(msg)); |
978 | pr_cont("Outstanding acks: %lu\n", | |
979 | (unsigned long) TIPC_SKB_CB(buf)->handle); | |
617dbeaa | 980 | |
01d83edd | 981 | n_ptr = tipc_bclink_retransmit_to(); |
d356eeba AS |
982 | tipc_node_lock(n_ptr); |
983 | ||
c68ca7b7 | 984 | tipc_addr_string_fill(addr_string, n_ptr->addr); |
2cf8aa19 | 985 | pr_info("Broadcast link info for %s\n", addr_string); |
389dd9bc YX |
986 | pr_info("Reception permitted: %d, Acked: %u\n", |
987 | n_ptr->bclink.recv_permitted, | |
2cf8aa19 EH |
988 | n_ptr->bclink.acked); |
989 | pr_info("Last in: %u, Oos state: %u, Last sent: %u\n", | |
990 | n_ptr->bclink.last_in, | |
991 | n_ptr->bclink.oos_state, | |
992 | n_ptr->bclink.last_sent); | |
d356eeba | 993 | |
d356eeba AS |
994 | tipc_node_unlock(n_ptr); |
995 | ||
3f5a12bd | 996 | tipc_bclink_set_flags(TIPC_BCLINK_RESET); |
d356eeba AS |
997 | l_ptr->stale_count = 0; |
998 | } | |
999 | } | |
1000 | ||
a18c4bc3 | 1001 | void tipc_link_retransmit(struct tipc_link *l_ptr, struct sk_buff *buf, |
4323add6 | 1002 | u32 retransmits) |
b97bf3fd PL |
1003 | { |
1004 | struct tipc_msg *msg; | |
1005 | ||
d356eeba AS |
1006 | if (!buf) |
1007 | return; | |
1008 | ||
1009 | msg = buf_msg(buf); | |
c4307285 | 1010 | |
512137ee EH |
1011 | /* Detect repeated retransmit failures */ |
1012 | if (l_ptr->last_retransmitted == msg_seqno(msg)) { | |
1013 | if (++l_ptr->stale_count > 100) { | |
1014 | link_retransmit_failure(l_ptr, buf); | |
1015 | return; | |
d356eeba AS |
1016 | } |
1017 | } else { | |
512137ee EH |
1018 | l_ptr->last_retransmitted = msg_seqno(msg); |
1019 | l_ptr->stale_count = 1; | |
b97bf3fd | 1020 | } |
d356eeba | 1021 | |
ca509101 | 1022 | while (retransmits && (buf != l_ptr->next_out) && buf) { |
b97bf3fd PL |
1023 | msg = buf_msg(buf); |
1024 | msg_set_ack(msg, mod(l_ptr->next_in_no - 1)); | |
c4307285 | 1025 | msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in); |
7a2f7d18 | 1026 | tipc_bearer_send(l_ptr->bearer_id, buf, &l_ptr->media_addr); |
3c294cb3 YX |
1027 | buf = buf->next; |
1028 | retransmits--; | |
1029 | l_ptr->stats.retransmitted++; | |
b97bf3fd | 1030 | } |
d356eeba | 1031 | |
b97bf3fd PL |
1032 | l_ptr->retransm_queue_head = l_ptr->retransm_queue_size = 0; |
1033 | } | |
1034 | ||
c4307285 | 1035 | /** |
b97bf3fd PL |
1036 | * link_insert_deferred_queue - insert deferred messages back into receive chain |
1037 | */ | |
a18c4bc3 | 1038 | static struct sk_buff *link_insert_deferred_queue(struct tipc_link *l_ptr, |
b97bf3fd PL |
1039 | struct sk_buff *buf) |
1040 | { | |
1041 | u32 seq_no; | |
1042 | ||
1043 | if (l_ptr->oldest_deferred_in == NULL) | |
1044 | return buf; | |
1045 | ||
f905730c | 1046 | seq_no = buf_seqno(l_ptr->oldest_deferred_in); |
b97bf3fd PL |
1047 | if (seq_no == mod(l_ptr->next_in_no)) { |
1048 | l_ptr->newest_deferred_in->next = buf; | |
1049 | buf = l_ptr->oldest_deferred_in; | |
1050 | l_ptr->oldest_deferred_in = NULL; | |
1051 | l_ptr->deferred_inqueue_sz = 0; | |
1052 | } | |
1053 | return buf; | |
1054 | } | |
1055 | ||
85035568 AS |
1056 | /** |
1057 | * link_recv_buf_validate - validate basic format of received message | |
1058 | * | |
1059 | * This routine ensures a TIPC message has an acceptable header, and at least | |
1060 | * as much data as the header indicates it should. The routine also ensures | |
1061 | * that the entire message header is stored in the main fragment of the message | |
1062 | * buffer, to simplify future access to message header fields. | |
1063 | * | |
1064 | * Note: Having extra info present in the message header or data areas is OK. | |
1065 | * TIPC will ignore the excess, under the assumption that it is optional info | |
1066 | * introduced by a later release of the protocol. | |
1067 | */ | |
85035568 AS |
1068 | static int link_recv_buf_validate(struct sk_buff *buf) |
1069 | { | |
1070 | static u32 min_data_hdr_size[8] = { | |
741d9eb7 | 1071 | SHORT_H_SIZE, MCAST_H_SIZE, NAMED_H_SIZE, BASIC_H_SIZE, |
85035568 AS |
1072 | MAX_H_SIZE, MAX_H_SIZE, MAX_H_SIZE, MAX_H_SIZE |
1073 | }; | |
1074 | ||
1075 | struct tipc_msg *msg; | |
1076 | u32 tipc_hdr[2]; | |
1077 | u32 size; | |
1078 | u32 hdr_size; | |
1079 | u32 min_hdr_size; | |
1080 | ||
64380a04 EH |
1081 | /* If this packet comes from the defer queue, the skb has already |
1082 | * been validated | |
1083 | */ | |
1084 | if (unlikely(TIPC_SKB_CB(buf)->deferred)) | |
1085 | return 1; | |
1086 | ||
85035568 AS |
1087 | if (unlikely(buf->len < MIN_H_SIZE)) |
1088 | return 0; | |
1089 | ||
1090 | msg = skb_header_pointer(buf, 0, sizeof(tipc_hdr), tipc_hdr); | |
1091 | if (msg == NULL) | |
1092 | return 0; | |
1093 | ||
1094 | if (unlikely(msg_version(msg) != TIPC_VERSION)) | |
1095 | return 0; | |
1096 | ||
1097 | size = msg_size(msg); | |
1098 | hdr_size = msg_hdr_sz(msg); | |
1099 | min_hdr_size = msg_isdata(msg) ? | |
1100 | min_data_hdr_size[msg_type(msg)] : INT_H_SIZE; | |
1101 | ||
1102 | if (unlikely((hdr_size < min_hdr_size) || | |
1103 | (size < hdr_size) || | |
1104 | (buf->len < size) || | |
1105 | (size - hdr_size > TIPC_MAX_USER_MSG_SIZE))) | |
1106 | return 0; | |
1107 | ||
1108 | return pskb_may_pull(buf, hdr_size); | |
1109 | } | |
1110 | ||
b02b69c8 | 1111 | /** |
170b3927 | 1112 | * tipc_rcv - process TIPC packets/messages arriving from off-node |
b02b69c8 | 1113 | * @head: pointer to message buffer chain |
7a2f7d18 | 1114 | * @b_ptr: pointer to bearer message arrived on |
b02b69c8 AS |
1115 | * |
1116 | * Invoked with no locks held. Bearer pointer must point to a valid bearer | |
1117 | * structure (i.e. cannot be NULL), but bearer can be inactive. | |
1118 | */ | |
170b3927 | 1119 | void tipc_rcv(struct sk_buff *head, struct tipc_bearer *b_ptr) |
b97bf3fd | 1120 | { |
b97bf3fd | 1121 | while (head) { |
6c00055a | 1122 | struct tipc_node *n_ptr; |
a18c4bc3 | 1123 | struct tipc_link *l_ptr; |
b97bf3fd PL |
1124 | struct sk_buff *crs; |
1125 | struct sk_buff *buf = head; | |
85035568 AS |
1126 | struct tipc_msg *msg; |
1127 | u32 seq_no; | |
1128 | u32 ackd; | |
b97bf3fd | 1129 | u32 released = 0; |
b97bf3fd | 1130 | |
b97bf3fd | 1131 | head = head->next; |
732256b9 | 1132 | buf->next = NULL; |
85035568 AS |
1133 | |
1134 | /* Ensure message is well-formed */ | |
85035568 | 1135 | if (unlikely(!link_recv_buf_validate(buf))) |
3af390e2 | 1136 | goto discard; |
b97bf3fd | 1137 | |
fe13dda2 | 1138 | /* Ensure message data is a single contiguous unit */ |
5f6d9123 | 1139 | if (unlikely(skb_linearize(buf))) |
3af390e2 | 1140 | goto discard; |
fe13dda2 | 1141 | |
85035568 | 1142 | /* Handle arrival of a non-unicast link message */ |
85035568 AS |
1143 | msg = buf_msg(buf); |
1144 | ||
b97bf3fd | 1145 | if (unlikely(msg_non_seq(msg))) { |
1265a021 | 1146 | if (msg_user(msg) == LINK_CONFIG) |
247f0f3c | 1147 | tipc_disc_rcv(buf, b_ptr); |
1265a021 | 1148 | else |
247f0f3c | 1149 | tipc_bclink_rcv(buf); |
b97bf3fd PL |
1150 | continue; |
1151 | } | |
c4307285 | 1152 | |
ed33a9c4 | 1153 | /* Discard unicast link messages destined for another node */ |
26008247 AS |
1154 | if (unlikely(!msg_short(msg) && |
1155 | (msg_destnode(msg) != tipc_own_addr))) | |
3af390e2 | 1156 | goto discard; |
c4307285 | 1157 | |
5a68d5ee | 1158 | /* Locate neighboring node that sent message */ |
4323add6 | 1159 | n_ptr = tipc_node_find(msg_prevnode(msg)); |
b97bf3fd | 1160 | if (unlikely(!n_ptr)) |
3af390e2 | 1161 | goto discard; |
4323add6 | 1162 | tipc_node_lock(n_ptr); |
85035568 | 1163 | |
b4b56102 | 1164 | /* Locate unicast link endpoint that should handle message */ |
b4b56102 | 1165 | l_ptr = n_ptr->links[b_ptr->identity]; |
3af390e2 YX |
1166 | if (unlikely(!l_ptr)) |
1167 | goto unlock_discard; | |
5a68d5ee | 1168 | |
b4b56102 | 1169 | /* Verify that communication with node is currently allowed */ |
aecb9bb8 | 1170 | if ((n_ptr->action_flags & TIPC_WAIT_PEER_LINKS_DOWN) && |
10f465c4 YX |
1171 | msg_user(msg) == LINK_PROTOCOL && |
1172 | (msg_type(msg) == RESET_MSG || | |
1173 | msg_type(msg) == ACTIVATE_MSG) && | |
1174 | !msg_redundant_link(msg)) | |
aecb9bb8 | 1175 | n_ptr->action_flags &= ~TIPC_WAIT_PEER_LINKS_DOWN; |
10f465c4 YX |
1176 | |
1177 | if (tipc_node_blocked(n_ptr)) | |
3af390e2 | 1178 | goto unlock_discard; |
85035568 AS |
1179 | |
1180 | /* Validate message sequence number info */ | |
85035568 AS |
1181 | seq_no = msg_seqno(msg); |
1182 | ackd = msg_ack(msg); | |
1183 | ||
1184 | /* Release acked messages */ | |
389dd9bc | 1185 | if (n_ptr->bclink.recv_permitted) |
36559591 | 1186 | tipc_bclink_acknowledge(n_ptr, msg_bcast_ack(msg)); |
b97bf3fd PL |
1187 | |
1188 | crs = l_ptr->first_out; | |
c4307285 | 1189 | while ((crs != l_ptr->next_out) && |
f905730c | 1190 | less_eq(buf_seqno(crs), ackd)) { |
b97bf3fd | 1191 | struct sk_buff *next = crs->next; |
5f6d9123 | 1192 | kfree_skb(crs); |
b97bf3fd PL |
1193 | crs = next; |
1194 | released++; | |
1195 | } | |
1196 | if (released) { | |
1197 | l_ptr->first_out = crs; | |
1198 | l_ptr->out_queue_size -= released; | |
1199 | } | |
85035568 AS |
1200 | |
1201 | /* Try sending any messages link endpoint has pending */ | |
b97bf3fd | 1202 | if (unlikely(l_ptr->next_out)) |
4323add6 | 1203 | tipc_link_push_queue(l_ptr); |
a5377831 | 1204 | |
b97bf3fd | 1205 | if (unlikely(!list_empty(&l_ptr->waiting_ports))) |
4323add6 | 1206 | tipc_link_wakeup_ports(l_ptr, 0); |
a5377831 | 1207 | |
a5377831 | 1208 | /* Process the incoming packet */ |
3af390e2 YX |
1209 | if (unlikely(!link_working_working(l_ptr))) { |
1210 | if (msg_user(msg) == LINK_PROTOCOL) { | |
247f0f3c | 1211 | tipc_link_proto_rcv(l_ptr, buf); |
3af390e2 | 1212 | head = link_insert_deferred_queue(l_ptr, head); |
4323add6 | 1213 | tipc_node_unlock(n_ptr); |
b97bf3fd PL |
1214 | continue; |
1215 | } | |
3af390e2 YX |
1216 | |
1217 | /* Traffic message. Conditionally activate link */ | |
1218 | link_state_event(l_ptr, TRAFFIC_MSG_EVT); | |
1219 | ||
1220 | if (link_working_working(l_ptr)) { | |
1221 | /* Re-insert buffer in front of queue */ | |
1222 | buf->next = head; | |
1223 | head = buf; | |
1224 | tipc_node_unlock(n_ptr); | |
1225 | continue; | |
1226 | } | |
1227 | goto unlock_discard; | |
1228 | } | |
1229 | ||
1230 | /* Link is now in state WORKING_WORKING */ | |
1231 | if (unlikely(seq_no != mod(l_ptr->next_in_no))) { | |
b97bf3fd PL |
1232 | link_handle_out_of_seq_msg(l_ptr, buf); |
1233 | head = link_insert_deferred_queue(l_ptr, head); | |
4323add6 | 1234 | tipc_node_unlock(n_ptr); |
b97bf3fd PL |
1235 | continue; |
1236 | } | |
3af390e2 YX |
1237 | l_ptr->next_in_no++; |
1238 | if (unlikely(l_ptr->oldest_deferred_in)) | |
b97bf3fd | 1239 | head = link_insert_deferred_queue(l_ptr, head); |
a5377831 | 1240 | |
3f53bd8f EH |
1241 | if (unlikely(++l_ptr->unacked_window >= TIPC_MIN_LINK_WIN)) { |
1242 | l_ptr->stats.sent_acks++; | |
1243 | tipc_link_proto_xmit(l_ptr, STATE_MSG, 0, 0, 0, 0, 0); | |
1244 | } | |
1245 | ||
7ae934be | 1246 | if (tipc_link_prepare_input(l_ptr, &buf)) { |
3af390e2 | 1247 | tipc_node_unlock(n_ptr); |
3af390e2 | 1248 | continue; |
b97bf3fd | 1249 | } |
4323add6 | 1250 | tipc_node_unlock(n_ptr); |
7ae934be EH |
1251 | msg = buf_msg(buf); |
1252 | if (tipc_link_input(l_ptr, buf) != 0) | |
1253 | goto discard; | |
3af390e2 YX |
1254 | continue; |
1255 | unlock_discard: | |
3af390e2 YX |
1256 | tipc_node_unlock(n_ptr); |
1257 | discard: | |
5f6d9123 | 1258 | kfree_skb(buf); |
b97bf3fd | 1259 | } |
b97bf3fd PL |
1260 | } |
1261 | ||
7ae934be EH |
1262 | /** |
1263 | * tipc_link_prepare_input - process TIPC link messages | |
1264 | * | |
1265 | * returns nonzero if the message was consumed | |
1266 | * | |
1267 | * Node lock must be held | |
1268 | */ | |
1269 | static int tipc_link_prepare_input(struct tipc_link *l, struct sk_buff **buf) | |
1270 | { | |
1271 | struct tipc_node *n; | |
1272 | struct tipc_msg *msg; | |
1273 | int res = -EINVAL; | |
1274 | ||
1275 | n = l->owner; | |
1276 | msg = buf_msg(*buf); | |
1277 | switch (msg_user(msg)) { | |
1278 | case CHANGEOVER_PROTOCOL: | |
1279 | if (tipc_link_tunnel_rcv(n, buf)) | |
1280 | res = 0; | |
1281 | break; | |
1282 | case MSG_FRAGMENTER: | |
1283 | l->stats.recv_fragments++; | |
1284 | if (tipc_buf_append(&l->reasm_buf, buf)) { | |
1285 | l->stats.recv_fragmented++; | |
1286 | res = 0; | |
1287 | } else if (!l->reasm_buf) { | |
1288 | tipc_link_reset(l); | |
1289 | } | |
1290 | break; | |
1291 | case MSG_BUNDLER: | |
1292 | l->stats.recv_bundles++; | |
1293 | l->stats.recv_bundled += msg_msgcnt(msg); | |
1294 | res = 0; | |
1295 | break; | |
1296 | case NAME_DISTRIBUTOR: | |
1297 | n->bclink.recv_permitted = true; | |
1298 | res = 0; | |
1299 | break; | |
1300 | case BCAST_PROTOCOL: | |
1301 | tipc_link_sync_rcv(n, *buf); | |
1302 | break; | |
1303 | default: | |
1304 | res = 0; | |
1305 | } | |
1306 | return res; | |
1307 | } | |
1308 | /** | |
1309 | * tipc_link_input - Deliver message too higher layers | |
1310 | */ | |
1311 | static int tipc_link_input(struct tipc_link *l, struct sk_buff *buf) | |
1312 | { | |
1313 | struct tipc_msg *msg = buf_msg(buf); | |
1314 | int res = 0; | |
1315 | ||
1316 | switch (msg_user(msg)) { | |
1317 | case TIPC_LOW_IMPORTANCE: | |
1318 | case TIPC_MEDIUM_IMPORTANCE: | |
1319 | case TIPC_HIGH_IMPORTANCE: | |
1320 | case TIPC_CRITICAL_IMPORTANCE: | |
1321 | case CONN_MANAGER: | |
1322 | tipc_sk_rcv(buf); | |
1323 | break; | |
1324 | case NAME_DISTRIBUTOR: | |
1325 | tipc_named_rcv(buf); | |
1326 | break; | |
1327 | case MSG_BUNDLER: | |
1328 | tipc_link_bundle_rcv(buf); | |
1329 | break; | |
1330 | default: | |
1331 | res = -EINVAL; | |
1332 | } | |
1333 | return res; | |
1334 | } | |
1335 | ||
2c53040f | 1336 | /** |
8809b255 AS |
1337 | * tipc_link_defer_pkt - Add out-of-sequence message to deferred reception queue |
1338 | * | |
1339 | * Returns increase in queue length (i.e. 0 or 1) | |
b97bf3fd | 1340 | */ |
8809b255 | 1341 | u32 tipc_link_defer_pkt(struct sk_buff **head, struct sk_buff **tail, |
4323add6 | 1342 | struct sk_buff *buf) |
b97bf3fd | 1343 | { |
8809b255 AS |
1344 | struct sk_buff *queue_buf; |
1345 | struct sk_buff **prev; | |
f905730c | 1346 | u32 seq_no = buf_seqno(buf); |
b97bf3fd PL |
1347 | |
1348 | buf->next = NULL; | |
1349 | ||
1350 | /* Empty queue ? */ | |
1351 | if (*head == NULL) { | |
1352 | *head = *tail = buf; | |
1353 | return 1; | |
1354 | } | |
1355 | ||
1356 | /* Last ? */ | |
f905730c | 1357 | if (less(buf_seqno(*tail), seq_no)) { |
b97bf3fd PL |
1358 | (*tail)->next = buf; |
1359 | *tail = buf; | |
1360 | return 1; | |
1361 | } | |
1362 | ||
8809b255 AS |
1363 | /* Locate insertion point in queue, then insert; discard if duplicate */ |
1364 | prev = head; | |
1365 | queue_buf = *head; | |
1366 | for (;;) { | |
1367 | u32 curr_seqno = buf_seqno(queue_buf); | |
b97bf3fd | 1368 | |
8809b255 | 1369 | if (seq_no == curr_seqno) { |
5f6d9123 | 1370 | kfree_skb(buf); |
8809b255 | 1371 | return 0; |
b97bf3fd | 1372 | } |
8809b255 AS |
1373 | |
1374 | if (less(seq_no, curr_seqno)) | |
b97bf3fd | 1375 | break; |
b97bf3fd | 1376 | |
8809b255 AS |
1377 | prev = &queue_buf->next; |
1378 | queue_buf = queue_buf->next; | |
1379 | } | |
b97bf3fd | 1380 | |
8809b255 AS |
1381 | buf->next = queue_buf; |
1382 | *prev = buf; | |
1383 | return 1; | |
b97bf3fd PL |
1384 | } |
1385 | ||
8809b255 | 1386 | /* |
b97bf3fd PL |
1387 | * link_handle_out_of_seq_msg - handle arrival of out-of-sequence packet |
1388 | */ | |
a18c4bc3 | 1389 | static void link_handle_out_of_seq_msg(struct tipc_link *l_ptr, |
b97bf3fd PL |
1390 | struct sk_buff *buf) |
1391 | { | |
f905730c | 1392 | u32 seq_no = buf_seqno(buf); |
b97bf3fd PL |
1393 | |
1394 | if (likely(msg_user(buf_msg(buf)) == LINK_PROTOCOL)) { | |
247f0f3c | 1395 | tipc_link_proto_rcv(l_ptr, buf); |
b97bf3fd PL |
1396 | return; |
1397 | } | |
1398 | ||
b97bf3fd | 1399 | /* Record OOS packet arrival (force mismatch on next timeout) */ |
b97bf3fd PL |
1400 | l_ptr->checkpoint--; |
1401 | ||
c4307285 | 1402 | /* |
b97bf3fd PL |
1403 | * Discard packet if a duplicate; otherwise add it to deferred queue |
1404 | * and notify peer of gap as per protocol specification | |
1405 | */ | |
b97bf3fd PL |
1406 | if (less(seq_no, mod(l_ptr->next_in_no))) { |
1407 | l_ptr->stats.duplicates++; | |
5f6d9123 | 1408 | kfree_skb(buf); |
b97bf3fd PL |
1409 | return; |
1410 | } | |
1411 | ||
4323add6 PL |
1412 | if (tipc_link_defer_pkt(&l_ptr->oldest_deferred_in, |
1413 | &l_ptr->newest_deferred_in, buf)) { | |
b97bf3fd PL |
1414 | l_ptr->deferred_inqueue_sz++; |
1415 | l_ptr->stats.deferred_recv++; | |
64380a04 | 1416 | TIPC_SKB_CB(buf)->deferred = true; |
b97bf3fd | 1417 | if ((l_ptr->deferred_inqueue_sz % 16) == 1) |
247f0f3c | 1418 | tipc_link_proto_xmit(l_ptr, STATE_MSG, 0, 0, 0, 0, 0); |
b97bf3fd PL |
1419 | } else |
1420 | l_ptr->stats.duplicates++; | |
1421 | } | |
1422 | ||
1423 | /* | |
1424 | * Send protocol message to the other endpoint. | |
1425 | */ | |
247f0f3c YX |
1426 | void tipc_link_proto_xmit(struct tipc_link *l_ptr, u32 msg_typ, int probe_msg, |
1427 | u32 gap, u32 tolerance, u32 priority, u32 ack_mtu) | |
b97bf3fd | 1428 | { |
1fc54d8f | 1429 | struct sk_buff *buf = NULL; |
b97bf3fd | 1430 | struct tipc_msg *msg = l_ptr->pmsg; |
c4307285 | 1431 | u32 msg_size = sizeof(l_ptr->proto_msg); |
75f0aa49 | 1432 | int r_flag; |
b97bf3fd | 1433 | |
92d2c905 | 1434 | /* Discard any previous message that was deferred due to congestion */ |
92d2c905 | 1435 | if (l_ptr->proto_msg_queue) { |
5f6d9123 | 1436 | kfree_skb(l_ptr->proto_msg_queue); |
92d2c905 AS |
1437 | l_ptr->proto_msg_queue = NULL; |
1438 | } | |
1439 | ||
77a7e07a YX |
1440 | /* Don't send protocol message during link changeover */ |
1441 | if (l_ptr->exp_msg_count) | |
b97bf3fd | 1442 | return; |
b4b56102 AS |
1443 | |
1444 | /* Abort non-RESET send if communication with node is prohibited */ | |
10f465c4 | 1445 | if ((tipc_node_blocked(l_ptr->owner)) && (msg_typ != RESET_MSG)) |
b4b56102 AS |
1446 | return; |
1447 | ||
92d2c905 | 1448 | /* Create protocol message with "out-of-sequence" sequence number */ |
b97bf3fd | 1449 | msg_set_type(msg, msg_typ); |
7a2f7d18 | 1450 | msg_set_net_plane(msg, l_ptr->net_plane); |
7a54d4a9 | 1451 | msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in); |
4323add6 | 1452 | msg_set_last_bcast(msg, tipc_bclink_get_last_sent()); |
b97bf3fd PL |
1453 | |
1454 | if (msg_typ == STATE_MSG) { | |
1455 | u32 next_sent = mod(l_ptr->next_out_no); | |
1456 | ||
4323add6 | 1457 | if (!tipc_link_is_up(l_ptr)) |
b97bf3fd PL |
1458 | return; |
1459 | if (l_ptr->next_out) | |
f905730c | 1460 | next_sent = buf_seqno(l_ptr->next_out); |
b97bf3fd PL |
1461 | msg_set_next_sent(msg, next_sent); |
1462 | if (l_ptr->oldest_deferred_in) { | |
f905730c | 1463 | u32 rec = buf_seqno(l_ptr->oldest_deferred_in); |
b97bf3fd PL |
1464 | gap = mod(rec - mod(l_ptr->next_in_no)); |
1465 | } | |
1466 | msg_set_seq_gap(msg, gap); | |
1467 | if (gap) | |
1468 | l_ptr->stats.sent_nacks++; | |
1469 | msg_set_link_tolerance(msg, tolerance); | |
1470 | msg_set_linkprio(msg, priority); | |
1471 | msg_set_max_pkt(msg, ack_mtu); | |
1472 | msg_set_ack(msg, mod(l_ptr->next_in_no - 1)); | |
1473 | msg_set_probe(msg, probe_msg != 0); | |
c4307285 | 1474 | if (probe_msg) { |
b97bf3fd PL |
1475 | u32 mtu = l_ptr->max_pkt; |
1476 | ||
c4307285 | 1477 | if ((mtu < l_ptr->max_pkt_target) && |
b97bf3fd PL |
1478 | link_working_working(l_ptr) && |
1479 | l_ptr->fsm_msg_cnt) { | |
1480 | msg_size = (mtu + (l_ptr->max_pkt_target - mtu)/2 + 2) & ~3; | |
c4307285 YH |
1481 | if (l_ptr->max_pkt_probes == 10) { |
1482 | l_ptr->max_pkt_target = (msg_size - 4); | |
1483 | l_ptr->max_pkt_probes = 0; | |
b97bf3fd | 1484 | msg_size = (mtu + (l_ptr->max_pkt_target - mtu)/2 + 2) & ~3; |
c4307285 | 1485 | } |
b97bf3fd | 1486 | l_ptr->max_pkt_probes++; |
c4307285 | 1487 | } |
b97bf3fd PL |
1488 | |
1489 | l_ptr->stats.sent_probes++; | |
c4307285 | 1490 | } |
b97bf3fd PL |
1491 | l_ptr->stats.sent_states++; |
1492 | } else { /* RESET_MSG or ACTIVATE_MSG */ | |
1493 | msg_set_ack(msg, mod(l_ptr->reset_checkpoint - 1)); | |
1494 | msg_set_seq_gap(msg, 0); | |
1495 | msg_set_next_sent(msg, 1); | |
f23d9bf2 | 1496 | msg_set_probe(msg, 0); |
b97bf3fd PL |
1497 | msg_set_link_tolerance(msg, l_ptr->tolerance); |
1498 | msg_set_linkprio(msg, l_ptr->priority); | |
1499 | msg_set_max_pkt(msg, l_ptr->max_pkt_target); | |
1500 | } | |
1501 | ||
75f0aa49 AS |
1502 | r_flag = (l_ptr->owner->working_links > tipc_link_is_up(l_ptr)); |
1503 | msg_set_redundant_link(msg, r_flag); | |
b97bf3fd | 1504 | msg_set_linkprio(msg, l_ptr->priority); |
92d2c905 | 1505 | msg_set_size(msg, msg_size); |
b97bf3fd PL |
1506 | |
1507 | msg_set_seqno(msg, mod(l_ptr->next_out_no + (0xffff/2))); | |
1508 | ||
31e3c3f6 | 1509 | buf = tipc_buf_acquire(msg_size); |
b97bf3fd PL |
1510 | if (!buf) |
1511 | return; | |
1512 | ||
27d7ff46 | 1513 | skb_copy_to_linear_data(buf, msg, sizeof(l_ptr->proto_msg)); |
796c75d0 | 1514 | buf->priority = TC_PRIO_CONTROL; |
b97bf3fd | 1515 | |
7a2f7d18 | 1516 | tipc_bearer_send(l_ptr->bearer_id, buf, &l_ptr->media_addr); |
92d2c905 | 1517 | l_ptr->unacked_window = 0; |
5f6d9123 | 1518 | kfree_skb(buf); |
b97bf3fd PL |
1519 | } |
1520 | ||
1521 | /* | |
1522 | * Receive protocol message : | |
c4307285 YH |
1523 | * Note that network plane id propagates through the network, and may |
1524 | * change at any time. The node with lowest address rules | |
b97bf3fd | 1525 | */ |
247f0f3c | 1526 | static void tipc_link_proto_rcv(struct tipc_link *l_ptr, struct sk_buff *buf) |
b97bf3fd PL |
1527 | { |
1528 | u32 rec_gap = 0; | |
1529 | u32 max_pkt_info; | |
c4307285 | 1530 | u32 max_pkt_ack; |
b97bf3fd PL |
1531 | u32 msg_tol; |
1532 | struct tipc_msg *msg = buf_msg(buf); | |
1533 | ||
77a7e07a YX |
1534 | /* Discard protocol message during link changeover */ |
1535 | if (l_ptr->exp_msg_count) | |
b97bf3fd PL |
1536 | goto exit; |
1537 | ||
7a2f7d18 | 1538 | if (l_ptr->net_plane != msg_net_plane(msg)) |
b97bf3fd | 1539 | if (tipc_own_addr > msg_prevnode(msg)) |
7a2f7d18 | 1540 | l_ptr->net_plane = msg_net_plane(msg); |
b97bf3fd | 1541 | |
b97bf3fd | 1542 | switch (msg_type(msg)) { |
c4307285 | 1543 | |
b97bf3fd | 1544 | case RESET_MSG: |
a686e685 AS |
1545 | if (!link_working_unknown(l_ptr) && |
1546 | (l_ptr->peer_session != INVALID_SESSION)) { | |
641c218d AS |
1547 | if (less_eq(msg_session(msg), l_ptr->peer_session)) |
1548 | break; /* duplicate or old reset: ignore */ | |
b97bf3fd | 1549 | } |
b4b56102 AS |
1550 | |
1551 | if (!msg_redundant_link(msg) && (link_working_working(l_ptr) || | |
1552 | link_working_unknown(l_ptr))) { | |
1553 | /* | |
1554 | * peer has lost contact -- don't allow peer's links | |
1555 | * to reactivate before we recognize loss & clean up | |
1556 | */ | |
ca9cf06a | 1557 | l_ptr->owner->action_flags |= TIPC_WAIT_OWN_LINKS_DOWN; |
b4b56102 AS |
1558 | } |
1559 | ||
47361c87 AS |
1560 | link_state_event(l_ptr, RESET_MSG); |
1561 | ||
b97bf3fd PL |
1562 | /* fall thru' */ |
1563 | case ACTIVATE_MSG: | |
1564 | /* Update link settings according other endpoint's values */ | |
b97bf3fd PL |
1565 | strcpy((strrchr(l_ptr->name, ':') + 1), (char *)msg_data(msg)); |
1566 | ||
2db9983a AS |
1567 | msg_tol = msg_link_tolerance(msg); |
1568 | if (msg_tol > l_ptr->tolerance) | |
b97bf3fd PL |
1569 | link_set_supervision_props(l_ptr, msg_tol); |
1570 | ||
1571 | if (msg_linkprio(msg) > l_ptr->priority) | |
1572 | l_ptr->priority = msg_linkprio(msg); | |
1573 | ||
1574 | max_pkt_info = msg_max_pkt(msg); | |
c4307285 | 1575 | if (max_pkt_info) { |
b97bf3fd PL |
1576 | if (max_pkt_info < l_ptr->max_pkt_target) |
1577 | l_ptr->max_pkt_target = max_pkt_info; | |
1578 | if (l_ptr->max_pkt > l_ptr->max_pkt_target) | |
1579 | l_ptr->max_pkt = l_ptr->max_pkt_target; | |
1580 | } else { | |
c4307285 | 1581 | l_ptr->max_pkt = l_ptr->max_pkt_target; |
b97bf3fd | 1582 | } |
b97bf3fd | 1583 | |
4d75313c | 1584 | /* Synchronize broadcast link info, if not done previously */ |
7a54d4a9 AS |
1585 | if (!tipc_node_is_up(l_ptr->owner)) { |
1586 | l_ptr->owner->bclink.last_sent = | |
1587 | l_ptr->owner->bclink.last_in = | |
1588 | msg_last_bcast(msg); | |
1589 | l_ptr->owner->bclink.oos_state = 0; | |
1590 | } | |
4d75313c | 1591 | |
b97bf3fd PL |
1592 | l_ptr->peer_session = msg_session(msg); |
1593 | l_ptr->peer_bearer_id = msg_bearer_id(msg); | |
47361c87 AS |
1594 | |
1595 | if (msg_type(msg) == ACTIVATE_MSG) | |
1596 | link_state_event(l_ptr, ACTIVATE_MSG); | |
b97bf3fd PL |
1597 | break; |
1598 | case STATE_MSG: | |
1599 | ||
2db9983a AS |
1600 | msg_tol = msg_link_tolerance(msg); |
1601 | if (msg_tol) | |
b97bf3fd | 1602 | link_set_supervision_props(l_ptr, msg_tol); |
c4307285 YH |
1603 | |
1604 | if (msg_linkprio(msg) && | |
b97bf3fd | 1605 | (msg_linkprio(msg) != l_ptr->priority)) { |
2cf8aa19 EH |
1606 | pr_warn("%s<%s>, priority change %u->%u\n", |
1607 | link_rst_msg, l_ptr->name, l_ptr->priority, | |
1608 | msg_linkprio(msg)); | |
b97bf3fd | 1609 | l_ptr->priority = msg_linkprio(msg); |
4323add6 | 1610 | tipc_link_reset(l_ptr); /* Enforce change to take effect */ |
b97bf3fd PL |
1611 | break; |
1612 | } | |
ec37dcd3 JPM |
1613 | |
1614 | /* Record reception; force mismatch at next timeout: */ | |
1615 | l_ptr->checkpoint--; | |
1616 | ||
b97bf3fd PL |
1617 | link_state_event(l_ptr, TRAFFIC_MSG_EVT); |
1618 | l_ptr->stats.recv_states++; | |
1619 | if (link_reset_unknown(l_ptr)) | |
1620 | break; | |
1621 | ||
1622 | if (less_eq(mod(l_ptr->next_in_no), msg_next_sent(msg))) { | |
c4307285 | 1623 | rec_gap = mod(msg_next_sent(msg) - |
b97bf3fd PL |
1624 | mod(l_ptr->next_in_no)); |
1625 | } | |
1626 | ||
1627 | max_pkt_ack = msg_max_pkt(msg); | |
c4307285 | 1628 | if (max_pkt_ack > l_ptr->max_pkt) { |
c4307285 YH |
1629 | l_ptr->max_pkt = max_pkt_ack; |
1630 | l_ptr->max_pkt_probes = 0; | |
1631 | } | |
b97bf3fd PL |
1632 | |
1633 | max_pkt_ack = 0; | |
c4307285 | 1634 | if (msg_probe(msg)) { |
b97bf3fd | 1635 | l_ptr->stats.recv_probes++; |
a016892c | 1636 | if (msg_size(msg) > sizeof(l_ptr->proto_msg)) |
c4307285 | 1637 | max_pkt_ack = msg_size(msg); |
c4307285 | 1638 | } |
b97bf3fd PL |
1639 | |
1640 | /* Protocol message before retransmits, reduce loss risk */ | |
389dd9bc | 1641 | if (l_ptr->owner->bclink.recv_permitted) |
7a54d4a9 AS |
1642 | tipc_bclink_update_link_state(l_ptr->owner, |
1643 | msg_last_bcast(msg)); | |
b97bf3fd PL |
1644 | |
1645 | if (rec_gap || (msg_probe(msg))) { | |
247f0f3c YX |
1646 | tipc_link_proto_xmit(l_ptr, STATE_MSG, 0, rec_gap, 0, |
1647 | 0, max_pkt_ack); | |
b97bf3fd PL |
1648 | } |
1649 | if (msg_seq_gap(msg)) { | |
b97bf3fd | 1650 | l_ptr->stats.recv_nacks++; |
4323add6 PL |
1651 | tipc_link_retransmit(l_ptr, l_ptr->first_out, |
1652 | msg_seq_gap(msg)); | |
b97bf3fd PL |
1653 | } |
1654 | break; | |
b97bf3fd PL |
1655 | } |
1656 | exit: | |
5f6d9123 | 1657 | kfree_skb(buf); |
b97bf3fd PL |
1658 | } |
1659 | ||
1660 | ||
170b3927 JPM |
1661 | /* tipc_link_tunnel_xmit(): Tunnel one packet via a link belonging to |
1662 | * a different bearer. Owner node is locked. | |
b97bf3fd | 1663 | */ |
170b3927 JPM |
1664 | static void tipc_link_tunnel_xmit(struct tipc_link *l_ptr, |
1665 | struct tipc_msg *tunnel_hdr, | |
1666 | struct tipc_msg *msg, | |
1667 | u32 selector) | |
b97bf3fd | 1668 | { |
a18c4bc3 | 1669 | struct tipc_link *tunnel; |
b97bf3fd PL |
1670 | struct sk_buff *buf; |
1671 | u32 length = msg_size(msg); | |
1672 | ||
1673 | tunnel = l_ptr->owner->active_links[selector & 1]; | |
5392d646 | 1674 | if (!tipc_link_is_up(tunnel)) { |
2cf8aa19 | 1675 | pr_warn("%stunnel link no longer available\n", link_co_err); |
b97bf3fd | 1676 | return; |
5392d646 | 1677 | } |
b97bf3fd | 1678 | msg_set_size(tunnel_hdr, length + INT_H_SIZE); |
31e3c3f6 | 1679 | buf = tipc_buf_acquire(length + INT_H_SIZE); |
5392d646 | 1680 | if (!buf) { |
2cf8aa19 | 1681 | pr_warn("%sunable to send tunnel msg\n", link_co_err); |
b97bf3fd | 1682 | return; |
5392d646 | 1683 | } |
27d7ff46 ACM |
1684 | skb_copy_to_linear_data(buf, tunnel_hdr, INT_H_SIZE); |
1685 | skb_copy_to_linear_data_offset(buf, INT_H_SIZE, msg, length); | |
9fbfb8b1 | 1686 | __tipc_link_xmit(tunnel, buf); |
b97bf3fd PL |
1687 | } |
1688 | ||
1689 | ||
170b3927 JPM |
1690 | /* tipc_link_failover_send_queue(): A link has gone down, but a second |
1691 | * link is still active. We can do failover. Tunnel the failing link's | |
1692 | * whole send queue via the remaining link. This way, we don't lose | |
1693 | * any packets, and sequence order is preserved for subsequent traffic | |
1694 | * sent over the remaining link. Owner node is locked. | |
b97bf3fd | 1695 | */ |
170b3927 | 1696 | void tipc_link_failover_send_queue(struct tipc_link *l_ptr) |
b97bf3fd PL |
1697 | { |
1698 | u32 msgcount = l_ptr->out_queue_size; | |
1699 | struct sk_buff *crs = l_ptr->first_out; | |
a18c4bc3 | 1700 | struct tipc_link *tunnel = l_ptr->owner->active_links[0]; |
b97bf3fd | 1701 | struct tipc_msg tunnel_hdr; |
5392d646 | 1702 | int split_bundles; |
b97bf3fd PL |
1703 | |
1704 | if (!tunnel) | |
1705 | return; | |
1706 | ||
c68ca7b7 | 1707 | tipc_msg_init(&tunnel_hdr, CHANGEOVER_PROTOCOL, |
75715217 | 1708 | ORIGINAL_MSG, INT_H_SIZE, l_ptr->addr); |
b97bf3fd PL |
1709 | msg_set_bearer_id(&tunnel_hdr, l_ptr->peer_bearer_id); |
1710 | msg_set_msgcnt(&tunnel_hdr, msgcount); | |
f131072c | 1711 | |
b97bf3fd PL |
1712 | if (!l_ptr->first_out) { |
1713 | struct sk_buff *buf; | |
1714 | ||
31e3c3f6 | 1715 | buf = tipc_buf_acquire(INT_H_SIZE); |
b97bf3fd | 1716 | if (buf) { |
27d7ff46 | 1717 | skb_copy_to_linear_data(buf, &tunnel_hdr, INT_H_SIZE); |
b97bf3fd | 1718 | msg_set_size(&tunnel_hdr, INT_H_SIZE); |
9fbfb8b1 | 1719 | __tipc_link_xmit(tunnel, buf); |
b97bf3fd | 1720 | } else { |
2cf8aa19 EH |
1721 | pr_warn("%sunable to send changeover msg\n", |
1722 | link_co_err); | |
b97bf3fd PL |
1723 | } |
1724 | return; | |
1725 | } | |
f131072c | 1726 | |
c4307285 | 1727 | split_bundles = (l_ptr->owner->active_links[0] != |
5392d646 AS |
1728 | l_ptr->owner->active_links[1]); |
1729 | ||
b97bf3fd PL |
1730 | while (crs) { |
1731 | struct tipc_msg *msg = buf_msg(crs); | |
1732 | ||
1733 | if ((msg_user(msg) == MSG_BUNDLER) && split_bundles) { | |
b97bf3fd | 1734 | struct tipc_msg *m = msg_get_wrapped(msg); |
0e65967e | 1735 | unchar *pos = (unchar *)m; |
b97bf3fd | 1736 | |
d788d805 | 1737 | msgcount = msg_msgcnt(msg); |
b97bf3fd | 1738 | while (msgcount--) { |
0e65967e | 1739 | msg_set_seqno(m, msg_seqno(msg)); |
170b3927 JPM |
1740 | tipc_link_tunnel_xmit(l_ptr, &tunnel_hdr, m, |
1741 | msg_link_selector(m)); | |
b97bf3fd PL |
1742 | pos += align(msg_size(m)); |
1743 | m = (struct tipc_msg *)pos; | |
1744 | } | |
1745 | } else { | |
170b3927 JPM |
1746 | tipc_link_tunnel_xmit(l_ptr, &tunnel_hdr, msg, |
1747 | msg_link_selector(msg)); | |
b97bf3fd PL |
1748 | } |
1749 | crs = crs->next; | |
1750 | } | |
1751 | } | |
1752 | ||
247f0f3c | 1753 | /* tipc_link_dup_queue_xmit(): A second link has become active. Tunnel a |
170b3927 JPM |
1754 | * duplicate of the first link's send queue via the new link. This way, we |
1755 | * are guaranteed that currently queued packets from a socket are delivered | |
1756 | * before future traffic from the same socket, even if this is using the | |
1757 | * new link. The last arriving copy of each duplicate packet is dropped at | |
1758 | * the receiving end by the regular protocol check, so packet cardinality | |
1759 | * and sequence order is preserved per sender/receiver socket pair. | |
1760 | * Owner node is locked. | |
1761 | */ | |
247f0f3c | 1762 | void tipc_link_dup_queue_xmit(struct tipc_link *l_ptr, |
170b3927 | 1763 | struct tipc_link *tunnel) |
b97bf3fd PL |
1764 | { |
1765 | struct sk_buff *iter; | |
1766 | struct tipc_msg tunnel_hdr; | |
1767 | ||
c68ca7b7 | 1768 | tipc_msg_init(&tunnel_hdr, CHANGEOVER_PROTOCOL, |
75715217 | 1769 | DUPLICATE_MSG, INT_H_SIZE, l_ptr->addr); |
b97bf3fd PL |
1770 | msg_set_msgcnt(&tunnel_hdr, l_ptr->out_queue_size); |
1771 | msg_set_bearer_id(&tunnel_hdr, l_ptr->peer_bearer_id); | |
1772 | iter = l_ptr->first_out; | |
1773 | while (iter) { | |
1774 | struct sk_buff *outbuf; | |
1775 | struct tipc_msg *msg = buf_msg(iter); | |
1776 | u32 length = msg_size(msg); | |
1777 | ||
1778 | if (msg_user(msg) == MSG_BUNDLER) | |
1779 | msg_set_type(msg, CLOSED_MSG); | |
1780 | msg_set_ack(msg, mod(l_ptr->next_in_no - 1)); /* Update */ | |
c4307285 | 1781 | msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in); |
b97bf3fd | 1782 | msg_set_size(&tunnel_hdr, length + INT_H_SIZE); |
31e3c3f6 | 1783 | outbuf = tipc_buf_acquire(length + INT_H_SIZE); |
b97bf3fd | 1784 | if (outbuf == NULL) { |
2cf8aa19 EH |
1785 | pr_warn("%sunable to send duplicate msg\n", |
1786 | link_co_err); | |
b97bf3fd PL |
1787 | return; |
1788 | } | |
27d7ff46 ACM |
1789 | skb_copy_to_linear_data(outbuf, &tunnel_hdr, INT_H_SIZE); |
1790 | skb_copy_to_linear_data_offset(outbuf, INT_H_SIZE, iter->data, | |
1791 | length); | |
9fbfb8b1 | 1792 | __tipc_link_xmit(tunnel, outbuf); |
4323add6 | 1793 | if (!tipc_link_is_up(l_ptr)) |
b97bf3fd PL |
1794 | return; |
1795 | iter = iter->next; | |
1796 | } | |
1797 | } | |
1798 | ||
b97bf3fd PL |
1799 | /** |
1800 | * buf_extract - extracts embedded TIPC message from another message | |
1801 | * @skb: encapsulating message buffer | |
1802 | * @from_pos: offset to extract from | |
1803 | * | |
c4307285 | 1804 | * Returns a new message buffer containing an embedded message. The |
b97bf3fd PL |
1805 | * encapsulating message itself is left unchanged. |
1806 | */ | |
b97bf3fd PL |
1807 | static struct sk_buff *buf_extract(struct sk_buff *skb, u32 from_pos) |
1808 | { | |
1809 | struct tipc_msg *msg = (struct tipc_msg *)(skb->data + from_pos); | |
1810 | u32 size = msg_size(msg); | |
1811 | struct sk_buff *eb; | |
1812 | ||
31e3c3f6 | 1813 | eb = tipc_buf_acquire(size); |
b97bf3fd | 1814 | if (eb) |
27d7ff46 | 1815 | skb_copy_to_linear_data(eb, msg, size); |
b97bf3fd PL |
1816 | return eb; |
1817 | } | |
1818 | ||
1dab3d5a JPM |
1819 | |
1820 | ||
1821 | /* tipc_link_dup_rcv(): Receive a tunnelled DUPLICATE_MSG packet. | |
1822 | * Owner node is locked. | |
1823 | */ | |
1824 | static void tipc_link_dup_rcv(struct tipc_link *l_ptr, | |
1825 | struct sk_buff *t_buf) | |
1826 | { | |
1827 | struct sk_buff *buf; | |
1828 | ||
1829 | if (!tipc_link_is_up(l_ptr)) | |
1830 | return; | |
1831 | ||
1832 | buf = buf_extract(t_buf, INT_H_SIZE); | |
1833 | if (buf == NULL) { | |
1834 | pr_warn("%sfailed to extract inner dup pkt\n", link_co_err); | |
1835 | return; | |
1836 | } | |
1837 | ||
1838 | /* Add buffer to deferred queue, if applicable: */ | |
1839 | link_handle_out_of_seq_msg(l_ptr, buf); | |
1840 | } | |
1841 | ||
f006c9c7 JPM |
1842 | /* tipc_link_failover_rcv(): Receive a tunnelled ORIGINAL_MSG packet |
1843 | * Owner node is locked. | |
1844 | */ | |
1845 | static struct sk_buff *tipc_link_failover_rcv(struct tipc_link *l_ptr, | |
1846 | struct sk_buff *t_buf) | |
1847 | { | |
1848 | struct tipc_msg *t_msg = buf_msg(t_buf); | |
1849 | struct sk_buff *buf = NULL; | |
1850 | struct tipc_msg *msg; | |
1851 | ||
1852 | if (tipc_link_is_up(l_ptr)) | |
1853 | tipc_link_reset(l_ptr); | |
1854 | ||
1855 | /* First failover packet? */ | |
1856 | if (l_ptr->exp_msg_count == START_CHANGEOVER) | |
1857 | l_ptr->exp_msg_count = msg_msgcnt(t_msg); | |
1858 | ||
1859 | /* Should there be an inner packet? */ | |
1860 | if (l_ptr->exp_msg_count) { | |
1861 | l_ptr->exp_msg_count--; | |
1862 | buf = buf_extract(t_buf, INT_H_SIZE); | |
1863 | if (buf == NULL) { | |
1864 | pr_warn("%sno inner failover pkt\n", link_co_err); | |
1865 | goto exit; | |
1866 | } | |
1867 | msg = buf_msg(buf); | |
1868 | ||
1869 | if (less(msg_seqno(msg), l_ptr->reset_checkpoint)) { | |
1870 | kfree_skb(buf); | |
1871 | buf = NULL; | |
1872 | goto exit; | |
1873 | } | |
1874 | if (msg_user(msg) == MSG_FRAGMENTER) { | |
1875 | l_ptr->stats.recv_fragments++; | |
37e22164 | 1876 | tipc_buf_append(&l_ptr->reasm_buf, &buf); |
f006c9c7 JPM |
1877 | } |
1878 | } | |
f006c9c7 | 1879 | exit: |
7d33939f JPM |
1880 | if ((l_ptr->exp_msg_count == 0) && (l_ptr->flags & LINK_STOPPED)) { |
1881 | tipc_node_detach_link(l_ptr->owner, l_ptr); | |
1882 | kfree(l_ptr); | |
1883 | } | |
f006c9c7 JPM |
1884 | return buf; |
1885 | } | |
1886 | ||
1dab3d5a | 1887 | /* tipc_link_tunnel_rcv(): Receive a tunnelled packet, sent |
170b3927 JPM |
1888 | * via other link as result of a failover (ORIGINAL_MSG) or |
1889 | * a new active link (DUPLICATE_MSG). Failover packets are | |
1890 | * returned to the active link for delivery upwards. | |
1891 | * Owner node is locked. | |
b97bf3fd | 1892 | */ |
3bb53380 | 1893 | static int tipc_link_tunnel_rcv(struct tipc_node *n_ptr, |
170b3927 | 1894 | struct sk_buff **buf) |
b97bf3fd | 1895 | { |
02842f71 JPM |
1896 | struct sk_buff *t_buf = *buf; |
1897 | struct tipc_link *l_ptr; | |
1898 | struct tipc_msg *t_msg = buf_msg(t_buf); | |
1899 | u32 bearer_id = msg_bearer_id(t_msg); | |
b97bf3fd | 1900 | |
1e9d47a9 JPM |
1901 | *buf = NULL; |
1902 | ||
cb4b102f DC |
1903 | if (bearer_id >= MAX_BEARERS) |
1904 | goto exit; | |
1dab3d5a | 1905 | |
02842f71 JPM |
1906 | l_ptr = n_ptr->links[bearer_id]; |
1907 | if (!l_ptr) | |
b97bf3fd | 1908 | goto exit; |
b97bf3fd | 1909 | |
02842f71 JPM |
1910 | if (msg_type(t_msg) == DUPLICATE_MSG) |
1911 | tipc_link_dup_rcv(l_ptr, t_buf); | |
1912 | else if (msg_type(t_msg) == ORIGINAL_MSG) | |
1913 | *buf = tipc_link_failover_rcv(l_ptr, t_buf); | |
1e9d47a9 JPM |
1914 | else |
1915 | pr_warn("%sunknown tunnel pkt received\n", link_co_err); | |
b97bf3fd | 1916 | exit: |
02842f71 | 1917 | kfree_skb(t_buf); |
1e9d47a9 | 1918 | return *buf != NULL; |
b97bf3fd PL |
1919 | } |
1920 | ||
1921 | /* | |
1922 | * Bundler functionality: | |
1923 | */ | |
247f0f3c | 1924 | void tipc_link_bundle_rcv(struct sk_buff *buf) |
b97bf3fd PL |
1925 | { |
1926 | u32 msgcount = msg_msgcnt(buf_msg(buf)); | |
1927 | u32 pos = INT_H_SIZE; | |
1928 | struct sk_buff *obuf; | |
ec8a2e56 | 1929 | struct tipc_msg *omsg; |
b97bf3fd | 1930 | |
b97bf3fd PL |
1931 | while (msgcount--) { |
1932 | obuf = buf_extract(buf, pos); | |
1933 | if (obuf == NULL) { | |
2cf8aa19 | 1934 | pr_warn("Link unable to unbundle message(s)\n"); |
a10bd924 | 1935 | break; |
3ff50b79 | 1936 | } |
ec8a2e56 JPM |
1937 | omsg = buf_msg(obuf); |
1938 | pos += align(msg_size(omsg)); | |
1939 | if (msg_isdata(omsg) || (msg_user(omsg) == CONN_MANAGER)) { | |
1940 | tipc_sk_rcv(obuf); | |
1941 | } else if (msg_user(omsg) == NAME_DISTRIBUTOR) { | |
1942 | tipc_named_rcv(obuf); | |
1943 | } else { | |
1944 | pr_warn("Illegal bundled msg: %u\n", msg_user(omsg)); | |
1945 | kfree_skb(obuf); | |
1946 | } | |
b97bf3fd | 1947 | } |
5f6d9123 | 1948 | kfree_skb(buf); |
b97bf3fd PL |
1949 | } |
1950 | ||
a18c4bc3 | 1951 | static void link_set_supervision_props(struct tipc_link *l_ptr, u32 tolerance) |
b97bf3fd | 1952 | { |
5413b4c6 AS |
1953 | if ((tolerance < TIPC_MIN_LINK_TOL) || (tolerance > TIPC_MAX_LINK_TOL)) |
1954 | return; | |
1955 | ||
b97bf3fd PL |
1956 | l_ptr->tolerance = tolerance; |
1957 | l_ptr->continuity_interval = | |
1958 | ((tolerance / 4) > 500) ? 500 : tolerance / 4; | |
1959 | l_ptr->abort_limit = tolerance / (l_ptr->continuity_interval / 4); | |
1960 | } | |
1961 | ||
a18c4bc3 | 1962 | void tipc_link_set_queue_limits(struct tipc_link *l_ptr, u32 window) |
b97bf3fd PL |
1963 | { |
1964 | /* Data messages from this node, inclusive FIRST_FRAGM */ | |
06d82c91 AS |
1965 | l_ptr->queue_limit[TIPC_LOW_IMPORTANCE] = window; |
1966 | l_ptr->queue_limit[TIPC_MEDIUM_IMPORTANCE] = (window / 3) * 4; | |
1967 | l_ptr->queue_limit[TIPC_HIGH_IMPORTANCE] = (window / 3) * 5; | |
1968 | l_ptr->queue_limit[TIPC_CRITICAL_IMPORTANCE] = (window / 3) * 6; | |
b97bf3fd | 1969 | /* Transiting data messages,inclusive FIRST_FRAGM */ |
06d82c91 AS |
1970 | l_ptr->queue_limit[TIPC_LOW_IMPORTANCE + 4] = 300; |
1971 | l_ptr->queue_limit[TIPC_MEDIUM_IMPORTANCE + 4] = 600; | |
1972 | l_ptr->queue_limit[TIPC_HIGH_IMPORTANCE + 4] = 900; | |
1973 | l_ptr->queue_limit[TIPC_CRITICAL_IMPORTANCE + 4] = 1200; | |
b97bf3fd | 1974 | l_ptr->queue_limit[CONN_MANAGER] = 1200; |
b97bf3fd PL |
1975 | l_ptr->queue_limit[CHANGEOVER_PROTOCOL] = 2500; |
1976 | l_ptr->queue_limit[NAME_DISTRIBUTOR] = 3000; | |
1977 | /* FRAGMENT and LAST_FRAGMENT packets */ | |
1978 | l_ptr->queue_limit[MSG_FRAGMENTER] = 4000; | |
1979 | } | |
1980 | ||
e099e86c JPM |
1981 | /* tipc_link_find_owner - locate owner node of link by link's name |
1982 | * @name: pointer to link name string | |
1983 | * @bearer_id: pointer to index in 'node->links' array where the link was found. | |
c4307285 | 1984 | * |
e099e86c | 1985 | * Returns pointer to node owning the link, or 0 if no matching link is found. |
b97bf3fd | 1986 | */ |
e099e86c JPM |
1987 | static struct tipc_node *tipc_link_find_owner(const char *link_name, |
1988 | unsigned int *bearer_id) | |
b97bf3fd | 1989 | { |
a18c4bc3 | 1990 | struct tipc_link *l_ptr; |
bbfbe47c | 1991 | struct tipc_node *n_ptr; |
e099e86c | 1992 | struct tipc_node *found_node = 0; |
bbfbe47c | 1993 | int i; |
b97bf3fd | 1994 | |
e099e86c | 1995 | *bearer_id = 0; |
6c7a762e YX |
1996 | rcu_read_lock(); |
1997 | list_for_each_entry_rcu(n_ptr, &tipc_node_list, list) { | |
a11607f5 | 1998 | tipc_node_lock(n_ptr); |
bbfbe47c EH |
1999 | for (i = 0; i < MAX_BEARERS; i++) { |
2000 | l_ptr = n_ptr->links[i]; | |
e099e86c JPM |
2001 | if (l_ptr && !strcmp(l_ptr->name, link_name)) { |
2002 | *bearer_id = i; | |
2003 | found_node = n_ptr; | |
2004 | break; | |
2005 | } | |
bbfbe47c | 2006 | } |
a11607f5 | 2007 | tipc_node_unlock(n_ptr); |
e099e86c JPM |
2008 | if (found_node) |
2009 | break; | |
bbfbe47c | 2010 | } |
6c7a762e YX |
2011 | rcu_read_unlock(); |
2012 | ||
e099e86c | 2013 | return found_node; |
b97bf3fd PL |
2014 | } |
2015 | ||
5c216e1d AS |
2016 | /** |
2017 | * link_value_is_valid -- validate proposed link tolerance/priority/window | |
2018 | * | |
2c53040f BH |
2019 | * @cmd: value type (TIPC_CMD_SET_LINK_*) |
2020 | * @new_value: the new value | |
5c216e1d AS |
2021 | * |
2022 | * Returns 1 if value is within range, 0 if not. | |
2023 | */ | |
5c216e1d AS |
2024 | static int link_value_is_valid(u16 cmd, u32 new_value) |
2025 | { | |
2026 | switch (cmd) { | |
2027 | case TIPC_CMD_SET_LINK_TOL: | |
2028 | return (new_value >= TIPC_MIN_LINK_TOL) && | |
2029 | (new_value <= TIPC_MAX_LINK_TOL); | |
2030 | case TIPC_CMD_SET_LINK_PRI: | |
2031 | return (new_value <= TIPC_MAX_LINK_PRI); | |
2032 | case TIPC_CMD_SET_LINK_WINDOW: | |
2033 | return (new_value >= TIPC_MIN_LINK_WIN) && | |
2034 | (new_value <= TIPC_MAX_LINK_WIN); | |
2035 | } | |
2036 | return 0; | |
2037 | } | |
2038 | ||
5c216e1d AS |
2039 | /** |
2040 | * link_cmd_set_value - change priority/tolerance/window for link/bearer/media | |
2c53040f BH |
2041 | * @name: ptr to link, bearer, or media name |
2042 | * @new_value: new value of link, bearer, or media setting | |
2043 | * @cmd: which link, bearer, or media attribute to set (TIPC_CMD_SET_LINK_*) | |
5c216e1d | 2044 | * |
7216cd94 | 2045 | * Caller must hold RTNL lock to ensure link/bearer/media is not deleted. |
5c216e1d AS |
2046 | * |
2047 | * Returns 0 if value updated and negative value on error. | |
2048 | */ | |
5c216e1d AS |
2049 | static int link_cmd_set_value(const char *name, u32 new_value, u16 cmd) |
2050 | { | |
2051 | struct tipc_node *node; | |
a18c4bc3 | 2052 | struct tipc_link *l_ptr; |
5c216e1d | 2053 | struct tipc_bearer *b_ptr; |
358a0d1c | 2054 | struct tipc_media *m_ptr; |
e099e86c | 2055 | int bearer_id; |
636c0371 | 2056 | int res = 0; |
5c216e1d | 2057 | |
e099e86c JPM |
2058 | node = tipc_link_find_owner(name, &bearer_id); |
2059 | if (node) { | |
5c216e1d | 2060 | tipc_node_lock(node); |
e099e86c JPM |
2061 | l_ptr = node->links[bearer_id]; |
2062 | ||
2063 | if (l_ptr) { | |
2064 | switch (cmd) { | |
2065 | case TIPC_CMD_SET_LINK_TOL: | |
2066 | link_set_supervision_props(l_ptr, new_value); | |
247f0f3c YX |
2067 | tipc_link_proto_xmit(l_ptr, STATE_MSG, 0, 0, |
2068 | new_value, 0, 0); | |
e099e86c JPM |
2069 | break; |
2070 | case TIPC_CMD_SET_LINK_PRI: | |
2071 | l_ptr->priority = new_value; | |
247f0f3c YX |
2072 | tipc_link_proto_xmit(l_ptr, STATE_MSG, 0, 0, |
2073 | 0, new_value, 0); | |
e099e86c JPM |
2074 | break; |
2075 | case TIPC_CMD_SET_LINK_WINDOW: | |
2076 | tipc_link_set_queue_limits(l_ptr, new_value); | |
2077 | break; | |
2078 | default: | |
2079 | res = -EINVAL; | |
2080 | break; | |
2081 | } | |
5c216e1d AS |
2082 | } |
2083 | tipc_node_unlock(node); | |
636c0371 | 2084 | return res; |
5c216e1d AS |
2085 | } |
2086 | ||
2087 | b_ptr = tipc_bearer_find(name); | |
2088 | if (b_ptr) { | |
2089 | switch (cmd) { | |
2090 | case TIPC_CMD_SET_LINK_TOL: | |
2091 | b_ptr->tolerance = new_value; | |
636c0371 | 2092 | break; |
5c216e1d AS |
2093 | case TIPC_CMD_SET_LINK_PRI: |
2094 | b_ptr->priority = new_value; | |
636c0371 | 2095 | break; |
5c216e1d AS |
2096 | case TIPC_CMD_SET_LINK_WINDOW: |
2097 | b_ptr->window = new_value; | |
636c0371 YX |
2098 | break; |
2099 | default: | |
2100 | res = -EINVAL; | |
2101 | break; | |
5c216e1d | 2102 | } |
636c0371 | 2103 | return res; |
5c216e1d AS |
2104 | } |
2105 | ||
2106 | m_ptr = tipc_media_find(name); | |
2107 | if (!m_ptr) | |
2108 | return -ENODEV; | |
2109 | switch (cmd) { | |
2110 | case TIPC_CMD_SET_LINK_TOL: | |
2111 | m_ptr->tolerance = new_value; | |
636c0371 | 2112 | break; |
5c216e1d AS |
2113 | case TIPC_CMD_SET_LINK_PRI: |
2114 | m_ptr->priority = new_value; | |
636c0371 | 2115 | break; |
5c216e1d AS |
2116 | case TIPC_CMD_SET_LINK_WINDOW: |
2117 | m_ptr->window = new_value; | |
636c0371 YX |
2118 | break; |
2119 | default: | |
2120 | res = -EINVAL; | |
2121 | break; | |
5c216e1d | 2122 | } |
636c0371 | 2123 | return res; |
5c216e1d AS |
2124 | } |
2125 | ||
c4307285 | 2126 | struct sk_buff *tipc_link_cmd_config(const void *req_tlv_area, int req_tlv_space, |
4323add6 | 2127 | u16 cmd) |
b97bf3fd PL |
2128 | { |
2129 | struct tipc_link_config *args; | |
c4307285 | 2130 | u32 new_value; |
c4307285 | 2131 | int res; |
b97bf3fd PL |
2132 | |
2133 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_LINK_CONFIG)) | |
4323add6 | 2134 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd PL |
2135 | |
2136 | args = (struct tipc_link_config *)TLV_DATA(req_tlv_area); | |
2137 | new_value = ntohl(args->value); | |
2138 | ||
5c216e1d AS |
2139 | if (!link_value_is_valid(cmd, new_value)) |
2140 | return tipc_cfg_reply_error_string( | |
2141 | "cannot change, value invalid"); | |
2142 | ||
4323add6 | 2143 | if (!strcmp(args->name, tipc_bclink_name)) { |
b97bf3fd | 2144 | if ((cmd == TIPC_CMD_SET_LINK_WINDOW) && |
4323add6 PL |
2145 | (tipc_bclink_set_queue_limits(new_value) == 0)) |
2146 | return tipc_cfg_reply_none(); | |
c4307285 | 2147 | return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED |
4323add6 | 2148 | " (cannot change setting on broadcast link)"); |
b97bf3fd PL |
2149 | } |
2150 | ||
5c216e1d | 2151 | res = link_cmd_set_value(args->name, new_value, cmd); |
b97bf3fd | 2152 | if (res) |
c4307285 | 2153 | return tipc_cfg_reply_error_string("cannot change link setting"); |
b97bf3fd | 2154 | |
4323add6 | 2155 | return tipc_cfg_reply_none(); |
b97bf3fd PL |
2156 | } |
2157 | ||
2158 | /** | |
2159 | * link_reset_statistics - reset link statistics | |
2160 | * @l_ptr: pointer to link | |
2161 | */ | |
a18c4bc3 | 2162 | static void link_reset_statistics(struct tipc_link *l_ptr) |
b97bf3fd PL |
2163 | { |
2164 | memset(&l_ptr->stats, 0, sizeof(l_ptr->stats)); | |
2165 | l_ptr->stats.sent_info = l_ptr->next_out_no; | |
2166 | l_ptr->stats.recv_info = l_ptr->next_in_no; | |
2167 | } | |
2168 | ||
4323add6 | 2169 | struct sk_buff *tipc_link_cmd_reset_stats(const void *req_tlv_area, int req_tlv_space) |
b97bf3fd PL |
2170 | { |
2171 | char *link_name; | |
a18c4bc3 | 2172 | struct tipc_link *l_ptr; |
6c00055a | 2173 | struct tipc_node *node; |
e099e86c | 2174 | unsigned int bearer_id; |
b97bf3fd PL |
2175 | |
2176 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_LINK_NAME)) | |
4323add6 | 2177 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd PL |
2178 | |
2179 | link_name = (char *)TLV_DATA(req_tlv_area); | |
4323add6 PL |
2180 | if (!strcmp(link_name, tipc_bclink_name)) { |
2181 | if (tipc_bclink_reset_stats()) | |
2182 | return tipc_cfg_reply_error_string("link not found"); | |
2183 | return tipc_cfg_reply_none(); | |
b97bf3fd | 2184 | } |
e099e86c | 2185 | node = tipc_link_find_owner(link_name, &bearer_id); |
7216cd94 | 2186 | if (!node) |
e099e86c | 2187 | return tipc_cfg_reply_error_string("link not found"); |
7216cd94 | 2188 | |
a11607f5 | 2189 | tipc_node_lock(node); |
e099e86c | 2190 | l_ptr = node->links[bearer_id]; |
b97bf3fd | 2191 | if (!l_ptr) { |
e099e86c | 2192 | tipc_node_unlock(node); |
4323add6 | 2193 | return tipc_cfg_reply_error_string("link not found"); |
b97bf3fd | 2194 | } |
b97bf3fd | 2195 | link_reset_statistics(l_ptr); |
4323add6 | 2196 | tipc_node_unlock(node); |
4323add6 | 2197 | return tipc_cfg_reply_none(); |
b97bf3fd PL |
2198 | } |
2199 | ||
2200 | /** | |
2201 | * percent - convert count to a percentage of total (rounding up or down) | |
2202 | */ | |
b97bf3fd PL |
2203 | static u32 percent(u32 count, u32 total) |
2204 | { | |
2205 | return (count * 100 + (total / 2)) / total; | |
2206 | } | |
2207 | ||
2208 | /** | |
4323add6 | 2209 | * tipc_link_stats - print link statistics |
b97bf3fd PL |
2210 | * @name: link name |
2211 | * @buf: print buffer area | |
2212 | * @buf_size: size of print buffer area | |
c4307285 | 2213 | * |
b97bf3fd PL |
2214 | * Returns length of print buffer data string (or 0 if error) |
2215 | */ | |
4323add6 | 2216 | static int tipc_link_stats(const char *name, char *buf, const u32 buf_size) |
b97bf3fd | 2217 | { |
dc1aed37 EH |
2218 | struct tipc_link *l; |
2219 | struct tipc_stats *s; | |
6c00055a | 2220 | struct tipc_node *node; |
b97bf3fd PL |
2221 | char *status; |
2222 | u32 profile_total = 0; | |
e099e86c | 2223 | unsigned int bearer_id; |
dc1aed37 | 2224 | int ret; |
b97bf3fd | 2225 | |
4323add6 PL |
2226 | if (!strcmp(name, tipc_bclink_name)) |
2227 | return tipc_bclink_stats(buf, buf_size); | |
b97bf3fd | 2228 | |
e099e86c | 2229 | node = tipc_link_find_owner(name, &bearer_id); |
7216cd94 | 2230 | if (!node) |
b97bf3fd | 2231 | return 0; |
7216cd94 | 2232 | |
4323add6 | 2233 | tipc_node_lock(node); |
e099e86c JPM |
2234 | |
2235 | l = node->links[bearer_id]; | |
2236 | if (!l) { | |
2237 | tipc_node_unlock(node); | |
e099e86c JPM |
2238 | return 0; |
2239 | } | |
2240 | ||
dc1aed37 | 2241 | s = &l->stats; |
b97bf3fd | 2242 | |
dc1aed37 | 2243 | if (tipc_link_is_active(l)) |
b97bf3fd | 2244 | status = "ACTIVE"; |
dc1aed37 | 2245 | else if (tipc_link_is_up(l)) |
b97bf3fd PL |
2246 | status = "STANDBY"; |
2247 | else | |
2248 | status = "DEFUNCT"; | |
dc1aed37 EH |
2249 | |
2250 | ret = tipc_snprintf(buf, buf_size, "Link <%s>\n" | |
2251 | " %s MTU:%u Priority:%u Tolerance:%u ms" | |
2252 | " Window:%u packets\n", | |
2253 | l->name, status, l->max_pkt, l->priority, | |
2254 | l->tolerance, l->queue_limit[0]); | |
2255 | ||
2256 | ret += tipc_snprintf(buf + ret, buf_size - ret, | |
2257 | " RX packets:%u fragments:%u/%u bundles:%u/%u\n", | |
2258 | l->next_in_no - s->recv_info, s->recv_fragments, | |
2259 | s->recv_fragmented, s->recv_bundles, | |
2260 | s->recv_bundled); | |
2261 | ||
2262 | ret += tipc_snprintf(buf + ret, buf_size - ret, | |
2263 | " TX packets:%u fragments:%u/%u bundles:%u/%u\n", | |
2264 | l->next_out_no - s->sent_info, s->sent_fragments, | |
2265 | s->sent_fragmented, s->sent_bundles, | |
2266 | s->sent_bundled); | |
2267 | ||
2268 | profile_total = s->msg_length_counts; | |
b97bf3fd PL |
2269 | if (!profile_total) |
2270 | profile_total = 1; | |
dc1aed37 EH |
2271 | |
2272 | ret += tipc_snprintf(buf + ret, buf_size - ret, | |
2273 | " TX profile sample:%u packets average:%u octets\n" | |
2274 | " 0-64:%u%% -256:%u%% -1024:%u%% -4096:%u%% " | |
2275 | "-16384:%u%% -32768:%u%% -66000:%u%%\n", | |
2276 | s->msg_length_counts, | |
2277 | s->msg_lengths_total / profile_total, | |
2278 | percent(s->msg_length_profile[0], profile_total), | |
2279 | percent(s->msg_length_profile[1], profile_total), | |
2280 | percent(s->msg_length_profile[2], profile_total), | |
2281 | percent(s->msg_length_profile[3], profile_total), | |
2282 | percent(s->msg_length_profile[4], profile_total), | |
2283 | percent(s->msg_length_profile[5], profile_total), | |
2284 | percent(s->msg_length_profile[6], profile_total)); | |
2285 | ||
2286 | ret += tipc_snprintf(buf + ret, buf_size - ret, | |
2287 | " RX states:%u probes:%u naks:%u defs:%u" | |
2288 | " dups:%u\n", s->recv_states, s->recv_probes, | |
2289 | s->recv_nacks, s->deferred_recv, s->duplicates); | |
2290 | ||
2291 | ret += tipc_snprintf(buf + ret, buf_size - ret, | |
2292 | " TX states:%u probes:%u naks:%u acks:%u" | |
2293 | " dups:%u\n", s->sent_states, s->sent_probes, | |
2294 | s->sent_nacks, s->sent_acks, s->retransmitted); | |
2295 | ||
2296 | ret += tipc_snprintf(buf + ret, buf_size - ret, | |
3c294cb3 YX |
2297 | " Congestion link:%u Send queue" |
2298 | " max:%u avg:%u\n", s->link_congs, | |
dc1aed37 EH |
2299 | s->max_queue_sz, s->queue_sz_counts ? |
2300 | (s->accu_queue_sz / s->queue_sz_counts) : 0); | |
b97bf3fd | 2301 | |
4323add6 | 2302 | tipc_node_unlock(node); |
dc1aed37 | 2303 | return ret; |
b97bf3fd PL |
2304 | } |
2305 | ||
4323add6 | 2306 | struct sk_buff *tipc_link_cmd_show_stats(const void *req_tlv_area, int req_tlv_space) |
b97bf3fd PL |
2307 | { |
2308 | struct sk_buff *buf; | |
2309 | struct tlv_desc *rep_tlv; | |
2310 | int str_len; | |
dc1aed37 EH |
2311 | int pb_len; |
2312 | char *pb; | |
b97bf3fd PL |
2313 | |
2314 | if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_LINK_NAME)) | |
4323add6 | 2315 | return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR); |
b97bf3fd | 2316 | |
dc1aed37 | 2317 | buf = tipc_cfg_reply_alloc(TLV_SPACE(ULTRA_STRING_MAX_LEN)); |
b97bf3fd PL |
2318 | if (!buf) |
2319 | return NULL; | |
2320 | ||
2321 | rep_tlv = (struct tlv_desc *)buf->data; | |
dc1aed37 EH |
2322 | pb = TLV_DATA(rep_tlv); |
2323 | pb_len = ULTRA_STRING_MAX_LEN; | |
4323add6 | 2324 | str_len = tipc_link_stats((char *)TLV_DATA(req_tlv_area), |
dc1aed37 | 2325 | pb, pb_len); |
b97bf3fd | 2326 | if (!str_len) { |
5f6d9123 | 2327 | kfree_skb(buf); |
c4307285 | 2328 | return tipc_cfg_reply_error_string("link not found"); |
b97bf3fd | 2329 | } |
dc1aed37 | 2330 | str_len += 1; /* for "\0" */ |
b97bf3fd PL |
2331 | skb_put(buf, TLV_SPACE(str_len)); |
2332 | TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len); | |
2333 | ||
2334 | return buf; | |
2335 | } | |
2336 | ||
b97bf3fd | 2337 | /** |
4323add6 | 2338 | * tipc_link_get_max_pkt - get maximum packet size to use when sending to destination |
b97bf3fd PL |
2339 | * @dest: network address of destination node |
2340 | * @selector: used to select from set of active links | |
c4307285 | 2341 | * |
b97bf3fd PL |
2342 | * If no active link can be found, uses default maximum packet size. |
2343 | */ | |
4323add6 | 2344 | u32 tipc_link_get_max_pkt(u32 dest, u32 selector) |
b97bf3fd | 2345 | { |
6c00055a | 2346 | struct tipc_node *n_ptr; |
a18c4bc3 | 2347 | struct tipc_link *l_ptr; |
b97bf3fd | 2348 | u32 res = MAX_PKT_DEFAULT; |
c4307285 | 2349 | |
b97bf3fd PL |
2350 | if (dest == tipc_own_addr) |
2351 | return MAX_MSG_SIZE; | |
2352 | ||
51a8e4de | 2353 | n_ptr = tipc_node_find(dest); |
b97bf3fd | 2354 | if (n_ptr) { |
4323add6 | 2355 | tipc_node_lock(n_ptr); |
b97bf3fd PL |
2356 | l_ptr = n_ptr->active_links[selector & 1]; |
2357 | if (l_ptr) | |
15e979da | 2358 | res = l_ptr->max_pkt; |
4323add6 | 2359 | tipc_node_unlock(n_ptr); |
b97bf3fd | 2360 | } |
b97bf3fd PL |
2361 | return res; |
2362 | } | |
2363 | ||
a18c4bc3 | 2364 | static void link_print(struct tipc_link *l_ptr, const char *str) |
b97bf3fd | 2365 | { |
7a2f7d18 YX |
2366 | struct tipc_bearer *b_ptr; |
2367 | ||
2368 | rcu_read_lock(); | |
2369 | b_ptr = rcu_dereference_rtnl(bearer_list[l_ptr->bearer_id]); | |
2370 | if (b_ptr) | |
2371 | pr_info("%s Link %x<%s>:", str, l_ptr->addr, b_ptr->name); | |
2372 | rcu_read_unlock(); | |
8d64a5ba | 2373 | |
b97bf3fd | 2374 | if (link_working_unknown(l_ptr)) |
5deedde9 | 2375 | pr_cont(":WU\n"); |
8d64a5ba | 2376 | else if (link_reset_reset(l_ptr)) |
5deedde9 | 2377 | pr_cont(":RR\n"); |
8d64a5ba | 2378 | else if (link_reset_unknown(l_ptr)) |
5deedde9 | 2379 | pr_cont(":RU\n"); |
8d64a5ba | 2380 | else if (link_working_working(l_ptr)) |
5deedde9 PG |
2381 | pr_cont(":WW\n"); |
2382 | else | |
2383 | pr_cont("\n"); | |
b97bf3fd | 2384 | } |