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