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