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