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