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