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