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