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