]>
Commit | Line | Data |
---|---|---|
b97bf3fd PL |
1 | /* |
2 | * net/tipc/link.c: TIPC link code | |
c4307285 | 3 | * |
c1336ee4 | 4 | * Copyright (c) 1996-2007, 2012-2015, Ericsson AB |
198d73b8 | 5 | * Copyright (c) 2004-2007, 2010-2013, Wind River Systems |
b97bf3fd PL |
6 | * All rights reserved. |
7 | * | |
9ea1fd3c | 8 | * Redistribution and use in source and binary forms, with or without |
b97bf3fd PL |
9 | * modification, are permitted provided that the following conditions are met: |
10 | * | |
9ea1fd3c PL |
11 | * 1. Redistributions of source code must retain the above copyright |
12 | * notice, this list of conditions and the following disclaimer. | |
13 | * 2. Redistributions in binary form must reproduce the above copyright | |
14 | * notice, this list of conditions and the following disclaimer in the | |
15 | * documentation and/or other materials provided with the distribution. | |
16 | * 3. Neither the names of the copyright holders nor the names of its | |
17 | * contributors may be used to endorse or promote products derived from | |
18 | * this software without specific prior written permission. | |
b97bf3fd | 19 | * |
9ea1fd3c PL |
20 | * Alternatively, this software may be distributed under the terms of the |
21 | * GNU General Public License ("GPL") version 2 as published by the Free | |
22 | * Software Foundation. | |
23 | * | |
24 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" | |
25 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
26 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
27 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | |
28 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | |
29 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | |
30 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
31 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | |
32 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
33 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
b97bf3fd PL |
34 | * POSSIBILITY OF SUCH DAMAGE. |
35 | */ | |
36 | ||
37 | #include "core.h" | |
e3eea1eb | 38 | #include "subscr.h" |
b97bf3fd | 39 | #include "link.h" |
7be57fc6 | 40 | #include "bcast.h" |
9816f061 | 41 | #include "socket.h" |
b97bf3fd | 42 | #include "name_distr.h" |
b97bf3fd | 43 | #include "discover.h" |
0655f6a8 | 44 | #include "netlink.h" |
b97bf3fd | 45 | |
796c75d0 YX |
46 | #include <linux/pkt_sched.h> |
47 | ||
2cf8aa19 EH |
48 | /* |
49 | * Error message prefixes | |
50 | */ | |
51 | static const char *link_co_err = "Link changeover error, "; | |
52 | static const char *link_rst_msg = "Resetting link "; | |
53 | static const char *link_unk_evt = "Unknown link event "; | |
b97bf3fd | 54 | |
7be57fc6 RA |
55 | static const struct nla_policy tipc_nl_link_policy[TIPC_NLA_LINK_MAX + 1] = { |
56 | [TIPC_NLA_LINK_UNSPEC] = { .type = NLA_UNSPEC }, | |
57 | [TIPC_NLA_LINK_NAME] = { | |
58 | .type = NLA_STRING, | |
59 | .len = TIPC_MAX_LINK_NAME | |
60 | }, | |
61 | [TIPC_NLA_LINK_MTU] = { .type = NLA_U32 }, | |
62 | [TIPC_NLA_LINK_BROADCAST] = { .type = NLA_FLAG }, | |
63 | [TIPC_NLA_LINK_UP] = { .type = NLA_FLAG }, | |
64 | [TIPC_NLA_LINK_ACTIVE] = { .type = NLA_FLAG }, | |
65 | [TIPC_NLA_LINK_PROP] = { .type = NLA_NESTED }, | |
66 | [TIPC_NLA_LINK_STATS] = { .type = NLA_NESTED }, | |
67 | [TIPC_NLA_LINK_RX] = { .type = NLA_U32 }, | |
68 | [TIPC_NLA_LINK_TX] = { .type = NLA_U32 } | |
69 | }; | |
70 | ||
0655f6a8 RA |
71 | /* Properties valid for media, bearar and link */ |
72 | static const struct nla_policy tipc_nl_prop_policy[TIPC_NLA_PROP_MAX + 1] = { | |
73 | [TIPC_NLA_PROP_UNSPEC] = { .type = NLA_UNSPEC }, | |
74 | [TIPC_NLA_PROP_PRIO] = { .type = NLA_U32 }, | |
75 | [TIPC_NLA_PROP_TOL] = { .type = NLA_U32 }, | |
76 | [TIPC_NLA_PROP_WIN] = { .type = NLA_U32 } | |
77 | }; | |
78 | ||
d999297c JPM |
79 | /* |
80 | * Interval between NACKs when packets arrive out of order | |
81 | */ | |
82 | #define TIPC_NACK_INTV (TIPC_MIN_LINK_WIN * 2) | |
a686e685 AS |
83 | /* |
84 | * Out-of-range value for link session numbers | |
85 | */ | |
d3504c34 | 86 | #define WILDCARD_SESSION 0x10000 |
a686e685 | 87 | |
d3504c34 | 88 | /* State value stored in 'failover_pkts' |
b97bf3fd | 89 | */ |
d3504c34 | 90 | #define FIRST_FAILOVER 0xffffu |
b97bf3fd | 91 | |
d3504c34 | 92 | /* Link FSM states and events: |
b97bf3fd | 93 | */ |
d3504c34 | 94 | enum { |
6ab30f9c JPM |
95 | TIPC_LINK_WORKING, |
96 | TIPC_LINK_PROBING, | |
97 | TIPC_LINK_RESETTING, | |
98 | TIPC_LINK_ESTABLISHING | |
d3504c34 JPM |
99 | }; |
100 | ||
101 | enum { | |
102 | PEER_RESET_EVT = RESET_MSG, | |
103 | ACTIVATE_EVT = ACTIVATE_MSG, | |
104 | TRAFFIC_EVT, /* Any other valid msg from peer */ | |
105 | SILENCE_EVT /* Peer was silent during last timer interval*/ | |
106 | }; | |
107 | ||
108 | /* Link FSM state checking routines | |
109 | */ | |
6ab30f9c | 110 | static int link_working(struct tipc_link *l) |
d3504c34 | 111 | { |
6ab30f9c | 112 | return l->state == TIPC_LINK_WORKING; |
d3504c34 JPM |
113 | } |
114 | ||
6ab30f9c | 115 | static int link_probing(struct tipc_link *l) |
d3504c34 | 116 | { |
6ab30f9c | 117 | return l->state == TIPC_LINK_PROBING; |
d3504c34 JPM |
118 | } |
119 | ||
6ab30f9c | 120 | static int link_resetting(struct tipc_link *l) |
d3504c34 | 121 | { |
6ab30f9c | 122 | return l->state == TIPC_LINK_RESETTING; |
d3504c34 JPM |
123 | } |
124 | ||
6ab30f9c | 125 | static int link_establishing(struct tipc_link *l) |
d3504c34 | 126 | { |
6ab30f9c | 127 | return l->state == TIPC_LINK_ESTABLISHING; |
d3504c34 | 128 | } |
b97bf3fd | 129 | |
d999297c JPM |
130 | static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb, |
131 | struct sk_buff_head *xmitq); | |
426cc2b8 JPM |
132 | static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe, |
133 | u16 rcvgap, int tolerance, int priority, | |
134 | struct sk_buff_head *xmitq); | |
a18c4bc3 PG |
135 | static void link_reset_statistics(struct tipc_link *l_ptr); |
136 | static void link_print(struct tipc_link *l_ptr, const char *str); | |
d999297c JPM |
137 | static void tipc_link_build_bcast_sync_msg(struct tipc_link *l, |
138 | struct sk_buff_head *xmitq); | |
247f0f3c | 139 | static void tipc_link_sync_rcv(struct tipc_node *n, struct sk_buff *buf); |
c637c103 JPM |
140 | static void tipc_link_input(struct tipc_link *l, struct sk_buff *skb); |
141 | static bool tipc_data_input(struct tipc_link *l, struct sk_buff *skb); | |
dff29b1a | 142 | static bool tipc_link_failover_rcv(struct tipc_link *l, struct sk_buff **skb); |
6ab30f9c | 143 | |
b97bf3fd | 144 | /* |
05790c64 | 145 | * Simple link routines |
b97bf3fd | 146 | */ |
05790c64 | 147 | static unsigned int align(unsigned int i) |
b97bf3fd PL |
148 | { |
149 | return (i + 3) & ~3u; | |
150 | } | |
151 | ||
8b4ed863 JPM |
152 | static struct tipc_link *tipc_parallel_link(struct tipc_link *l) |
153 | { | |
9d13ec65 JPM |
154 | struct tipc_node *n = l->owner; |
155 | ||
156 | if (node_active_link(n, 0) != l) | |
157 | return node_active_link(n, 0); | |
158 | return node_active_link(n, 1); | |
8b4ed863 JPM |
159 | } |
160 | ||
b97bf3fd | 161 | /* |
05790c64 | 162 | * Simple non-static link routines (i.e. referenced outside this file) |
b97bf3fd | 163 | */ |
a18c4bc3 | 164 | int tipc_link_is_up(struct tipc_link *l_ptr) |
b97bf3fd PL |
165 | { |
166 | if (!l_ptr) | |
167 | return 0; | |
6ab30f9c | 168 | return link_working(l_ptr) || link_probing(l_ptr); |
b97bf3fd PL |
169 | } |
170 | ||
9d13ec65 | 171 | int tipc_link_is_active(struct tipc_link *l) |
b97bf3fd | 172 | { |
9d13ec65 JPM |
173 | struct tipc_node *n = l->owner; |
174 | ||
175 | return (node_active_link(n, 0) == l) || (node_active_link(n, 1) == l); | |
b97bf3fd PL |
176 | } |
177 | ||
b97bf3fd | 178 | /** |
4323add6 | 179 | * tipc_link_create - create a new link |
37b9c08a | 180 | * @n_ptr: pointer to associated node |
b97bf3fd | 181 | * @b_ptr: pointer to associated bearer |
b97bf3fd | 182 | * @media_addr: media address to use when sending messages over link |
c4307285 | 183 | * |
b97bf3fd PL |
184 | * Returns pointer to link. |
185 | */ | |
a18c4bc3 | 186 | struct tipc_link *tipc_link_create(struct tipc_node *n_ptr, |
c61dd61d | 187 | struct tipc_bearer *b_ptr, |
d39bbd44 JPM |
188 | const struct tipc_media_addr *media_addr, |
189 | struct sk_buff_head *inputq, | |
190 | struct sk_buff_head *namedq) | |
b97bf3fd | 191 | { |
34747539 | 192 | struct tipc_net *tn = net_generic(n_ptr->net, tipc_net_id); |
a18c4bc3 | 193 | struct tipc_link *l_ptr; |
b97bf3fd PL |
194 | struct tipc_msg *msg; |
195 | char *if_name; | |
37b9c08a AS |
196 | char addr_string[16]; |
197 | u32 peer = n_ptr->addr; | |
198 | ||
0372bf5c | 199 | if (n_ptr->link_cnt >= MAX_BEARERS) { |
37b9c08a | 200 | tipc_addr_string_fill(addr_string, n_ptr->addr); |
a97b9d3f JPM |
201 | pr_err("Cannot establish %uth link to %s. Max %u allowed.\n", |
202 | n_ptr->link_cnt, addr_string, MAX_BEARERS); | |
37b9c08a AS |
203 | return NULL; |
204 | } | |
205 | ||
9d13ec65 | 206 | if (n_ptr->links[b_ptr->identity].link) { |
37b9c08a | 207 | tipc_addr_string_fill(addr_string, n_ptr->addr); |
2cf8aa19 EH |
208 | pr_err("Attempt to establish second link on <%s> to %s\n", |
209 | b_ptr->name, addr_string); | |
37b9c08a AS |
210 | return NULL; |
211 | } | |
b97bf3fd | 212 | |
0da974f4 | 213 | l_ptr = kzalloc(sizeof(*l_ptr), GFP_ATOMIC); |
b97bf3fd | 214 | if (!l_ptr) { |
2cf8aa19 | 215 | pr_warn("Link creation failed, no memory\n"); |
b97bf3fd PL |
216 | return NULL; |
217 | } | |
b97bf3fd | 218 | l_ptr->addr = peer; |
2d627b92 | 219 | if_name = strchr(b_ptr->name, ':') + 1; |
062b4c99 | 220 | sprintf(l_ptr->name, "%u.%u.%u:%s-%u.%u.%u:unknown", |
34747539 YX |
221 | tipc_zone(tn->own_addr), tipc_cluster(tn->own_addr), |
222 | tipc_node(tn->own_addr), | |
b97bf3fd PL |
223 | if_name, |
224 | tipc_zone(peer), tipc_cluster(peer), tipc_node(peer)); | |
062b4c99 | 225 | /* note: peer i/f name is updated by reset/activate message */ |
b97bf3fd | 226 | memcpy(&l_ptr->media_addr, media_addr, sizeof(*media_addr)); |
37b9c08a | 227 | l_ptr->owner = n_ptr; |
d3504c34 | 228 | l_ptr->peer_session = WILDCARD_SESSION; |
7a2f7d18 | 229 | l_ptr->bearer_id = b_ptr->identity; |
8a1577c9 | 230 | l_ptr->tolerance = b_ptr->tolerance; |
6ab30f9c | 231 | l_ptr->state = TIPC_LINK_RESETTING; |
b97bf3fd PL |
232 | |
233 | l_ptr->pmsg = (struct tipc_msg *)&l_ptr->proto_msg; | |
234 | msg = l_ptr->pmsg; | |
c5898636 | 235 | tipc_msg_init(tn->own_addr, msg, LINK_PROTOCOL, RESET_MSG, INT_H_SIZE, |
34747539 | 236 | l_ptr->addr); |
b97bf3fd | 237 | msg_set_size(msg, sizeof(l_ptr->proto_msg)); |
bafa29e3 | 238 | msg_set_session(msg, (tn->random & 0xffff)); |
b97bf3fd PL |
239 | msg_set_bearer_id(msg, b_ptr->identity); |
240 | strcpy((char *)msg_data(msg), if_name); | |
7a2f7d18 | 241 | l_ptr->net_plane = b_ptr->net_plane; |
ed193ece JPM |
242 | l_ptr->advertised_mtu = b_ptr->mtu; |
243 | l_ptr->mtu = l_ptr->advertised_mtu; | |
e3eea1eb JPM |
244 | l_ptr->priority = b_ptr->priority; |
245 | tipc_link_set_queue_limits(l_ptr, b_ptr->window); | |
a97b9d3f | 246 | l_ptr->snd_nxt = 1; |
05dcc5aa JPM |
247 | __skb_queue_head_init(&l_ptr->transmq); |
248 | __skb_queue_head_init(&l_ptr->backlogq); | |
249 | __skb_queue_head_init(&l_ptr->deferdq); | |
c637c103 | 250 | skb_queue_head_init(&l_ptr->wakeupq); |
d39bbd44 JPM |
251 | l_ptr->inputq = inputq; |
252 | l_ptr->namedq = namedq; | |
253 | skb_queue_head_init(l_ptr->inputq); | |
b97bf3fd | 254 | link_reset_statistics(l_ptr); |
37b9c08a | 255 | tipc_node_attach_link(n_ptr, l_ptr); |
b97bf3fd PL |
256 | return l_ptr; |
257 | } | |
258 | ||
2d72d495 | 259 | /** |
dff29b1a JPM |
260 | * tipc_link_delete - Delete a link |
261 | * @l: link to be deleted | |
2d72d495 | 262 | */ |
dff29b1a | 263 | void tipc_link_delete(struct tipc_link *l) |
2d72d495 | 264 | { |
dff29b1a | 265 | tipc_link_reset(l); |
dff29b1a JPM |
266 | tipc_link_reset_fragments(l); |
267 | tipc_node_detach_link(l->owner, l); | |
2d72d495 JPM |
268 | } |
269 | ||
b1c29f6b | 270 | void tipc_link_delete_list(struct net *net, unsigned int bearer_id) |
8d8439b6 | 271 | { |
f2f9800d | 272 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
2d72d495 JPM |
273 | struct tipc_link *link; |
274 | struct tipc_node *node; | |
8d8439b6 | 275 | |
6c7a762e | 276 | rcu_read_lock(); |
2d72d495 JPM |
277 | list_for_each_entry_rcu(node, &tn->node_list, list) { |
278 | tipc_node_lock(node); | |
9d13ec65 | 279 | link = node->links[bearer_id].link; |
dff29b1a | 280 | if (link) |
2d72d495 JPM |
281 | tipc_link_delete(link); |
282 | tipc_node_unlock(node); | |
8d8439b6 | 283 | } |
6c7a762e | 284 | rcu_read_unlock(); |
8d8439b6 | 285 | } |
b97bf3fd | 286 | |
d999297c JPM |
287 | /* tipc_link_build_bcast_sync_msg() - synchronize broadcast link endpoints. |
288 | * | |
289 | * Give a newly added peer node the sequence number where it should | |
290 | * start receiving and acking broadcast packets. | |
291 | */ | |
292 | static void tipc_link_build_bcast_sync_msg(struct tipc_link *l, | |
293 | struct sk_buff_head *xmitq) | |
294 | { | |
295 | struct sk_buff *skb; | |
296 | struct sk_buff_head list; | |
297 | ||
298 | skb = tipc_msg_create(BCAST_PROTOCOL, STATE_MSG, INT_H_SIZE, | |
299 | 0, l->addr, link_own_addr(l), 0, 0, 0); | |
300 | if (!skb) | |
301 | return; | |
302 | __skb_queue_head_init(&list); | |
303 | __skb_queue_tail(&list, skb); | |
304 | tipc_link_xmit(l, &list, xmitq); | |
305 | } | |
306 | ||
6ab30f9c JPM |
307 | /** |
308 | * tipc_link_fsm_evt - link finite state machine | |
309 | * @l: pointer to link | |
310 | * @evt: state machine event to be processed | |
311 | * @xmitq: queue to prepend created protocol message, if any | |
312 | */ | |
313 | static int tipc_link_fsm_evt(struct tipc_link *l, int evt, | |
314 | struct sk_buff_head *xmitq) | |
315 | { | |
316 | int mtyp = 0, rc = 0; | |
317 | struct tipc_link *pl; | |
318 | enum { | |
d999297c JPM |
319 | LINK_RESET = 1, |
320 | LINK_ACTIVATE = (1 << 1), | |
321 | SND_PROBE = (1 << 2), | |
322 | SND_STATE = (1 << 3), | |
323 | SND_RESET = (1 << 4), | |
324 | SND_ACTIVATE = (1 << 5), | |
325 | SND_BCAST_SYNC = (1 << 6) | |
6ab30f9c JPM |
326 | } actions = 0; |
327 | ||
328 | if (l->exec_mode == TIPC_LINK_BLOCKED) | |
329 | return rc; | |
330 | ||
331 | switch (l->state) { | |
332 | case TIPC_LINK_WORKING: | |
333 | switch (evt) { | |
334 | case TRAFFIC_EVT: | |
335 | case ACTIVATE_EVT: | |
336 | break; | |
337 | case SILENCE_EVT: | |
338 | l->state = TIPC_LINK_PROBING; | |
339 | actions |= SND_PROBE; | |
340 | break; | |
341 | case PEER_RESET_EVT: | |
342 | actions |= LINK_RESET | SND_ACTIVATE; | |
343 | break; | |
344 | default: | |
345 | pr_debug("%s%u WORKING\n", link_unk_evt, evt); | |
346 | } | |
347 | break; | |
348 | case TIPC_LINK_PROBING: | |
349 | switch (evt) { | |
350 | case TRAFFIC_EVT: | |
351 | case ACTIVATE_EVT: | |
352 | l->state = TIPC_LINK_WORKING; | |
353 | break; | |
354 | case PEER_RESET_EVT: | |
355 | actions |= LINK_RESET | SND_ACTIVATE; | |
356 | break; | |
357 | case SILENCE_EVT: | |
358 | if (l->silent_intv_cnt <= l->abort_limit) { | |
359 | actions |= SND_PROBE; | |
360 | break; | |
361 | } | |
362 | actions |= LINK_RESET | SND_RESET; | |
363 | break; | |
364 | default: | |
365 | pr_err("%s%u PROBING\n", link_unk_evt, evt); | |
366 | } | |
367 | break; | |
368 | case TIPC_LINK_RESETTING: | |
369 | switch (evt) { | |
370 | case TRAFFIC_EVT: | |
371 | break; | |
372 | case ACTIVATE_EVT: | |
373 | pl = node_active_link(l->owner, 0); | |
374 | if (pl && link_probing(pl)) | |
375 | break; | |
376 | actions |= LINK_ACTIVATE; | |
d999297c JPM |
377 | if (!l->owner->working_links) |
378 | actions |= SND_BCAST_SYNC; | |
6ab30f9c JPM |
379 | break; |
380 | case PEER_RESET_EVT: | |
381 | l->state = TIPC_LINK_ESTABLISHING; | |
382 | actions |= SND_ACTIVATE; | |
383 | break; | |
384 | case SILENCE_EVT: | |
385 | actions |= SND_RESET; | |
386 | break; | |
387 | default: | |
388 | pr_err("%s%u in RESETTING\n", link_unk_evt, evt); | |
389 | } | |
390 | break; | |
391 | case TIPC_LINK_ESTABLISHING: | |
392 | switch (evt) { | |
393 | case TRAFFIC_EVT: | |
394 | case ACTIVATE_EVT: | |
395 | pl = node_active_link(l->owner, 0); | |
396 | if (pl && link_probing(pl)) | |
397 | break; | |
398 | actions |= LINK_ACTIVATE; | |
d999297c JPM |
399 | if (!l->owner->working_links) |
400 | actions |= SND_BCAST_SYNC; | |
6ab30f9c JPM |
401 | break; |
402 | case PEER_RESET_EVT: | |
403 | break; | |
404 | case SILENCE_EVT: | |
405 | actions |= SND_ACTIVATE; | |
406 | break; | |
407 | default: | |
408 | pr_err("%s%u ESTABLISHING\n", link_unk_evt, evt); | |
409 | } | |
410 | break; | |
411 | default: | |
412 | pr_err("Unknown link state %u/%u\n", l->state, evt); | |
413 | } | |
414 | ||
415 | /* Perform actions as decided by FSM */ | |
416 | if (actions & LINK_RESET) { | |
417 | l->exec_mode = TIPC_LINK_BLOCKED; | |
418 | rc |= TIPC_LINK_DOWN_EVT; | |
419 | } | |
420 | if (actions & LINK_ACTIVATE) { | |
421 | l->exec_mode = TIPC_LINK_OPEN; | |
422 | rc |= TIPC_LINK_UP_EVT; | |
423 | } | |
424 | if (actions & (SND_STATE | SND_PROBE)) | |
425 | mtyp = STATE_MSG; | |
426 | if (actions & SND_RESET) | |
427 | mtyp = RESET_MSG; | |
428 | if (actions & SND_ACTIVATE) | |
429 | mtyp = ACTIVATE_MSG; | |
430 | if (actions & (SND_PROBE | SND_STATE | SND_RESET | SND_ACTIVATE)) | |
431 | tipc_link_build_proto_msg(l, mtyp, actions & SND_PROBE, | |
432 | 0, 0, 0, xmitq); | |
d999297c JPM |
433 | if (actions & SND_BCAST_SYNC) |
434 | tipc_link_build_bcast_sync_msg(l, xmitq); | |
6ab30f9c JPM |
435 | return rc; |
436 | } | |
437 | ||
333ef69e JPM |
438 | /* link_profile_stats - update statistical profiling of traffic |
439 | */ | |
440 | static void link_profile_stats(struct tipc_link *l) | |
441 | { | |
442 | struct sk_buff *skb; | |
443 | struct tipc_msg *msg; | |
444 | int length; | |
445 | ||
446 | /* Update counters used in statistical profiling of send traffic */ | |
447 | l->stats.accu_queue_sz += skb_queue_len(&l->transmq); | |
448 | l->stats.queue_sz_counts++; | |
449 | ||
450 | skb = skb_peek(&l->transmq); | |
451 | if (!skb) | |
452 | return; | |
453 | msg = buf_msg(skb); | |
454 | length = msg_size(msg); | |
455 | ||
456 | if (msg_user(msg) == MSG_FRAGMENTER) { | |
457 | if (msg_type(msg) != FIRST_FRAGMENT) | |
458 | return; | |
459 | length = msg_size(msg_get_wrapped(msg)); | |
460 | } | |
461 | l->stats.msg_lengths_total += length; | |
462 | l->stats.msg_length_counts++; | |
463 | if (length <= 64) | |
464 | l->stats.msg_length_profile[0]++; | |
465 | else if (length <= 256) | |
466 | l->stats.msg_length_profile[1]++; | |
467 | else if (length <= 1024) | |
468 | l->stats.msg_length_profile[2]++; | |
469 | else if (length <= 4096) | |
470 | l->stats.msg_length_profile[3]++; | |
471 | else if (length <= 16384) | |
472 | l->stats.msg_length_profile[4]++; | |
473 | else if (length <= 32768) | |
474 | l->stats.msg_length_profile[5]++; | |
475 | else | |
476 | l->stats.msg_length_profile[6]++; | |
477 | } | |
478 | ||
479 | /* tipc_link_timeout - perform periodic task as instructed from node timeout | |
480 | */ | |
481 | int tipc_link_timeout(struct tipc_link *l, struct sk_buff_head *xmitq) | |
482 | { | |
483 | int rc = 0; | |
484 | ||
485 | link_profile_stats(l); | |
486 | if (l->silent_intv_cnt) | |
487 | rc = tipc_link_fsm_evt(l, SILENCE_EVT, xmitq); | |
488 | else if (link_working(l) && tipc_bclink_acks_missing(l->owner)) | |
489 | tipc_link_build_proto_msg(l, STATE_MSG, 0, 0, 0, 0, xmitq); | |
490 | l->silent_intv_cnt++; | |
491 | return rc; | |
492 | } | |
493 | ||
b97bf3fd | 494 | /** |
3127a020 | 495 | * link_schedule_user - schedule a message sender for wakeup after congestion |
50100a5e | 496 | * @link: congested link |
3127a020 | 497 | * @list: message that was attempted sent |
50100a5e | 498 | * Create pseudo msg to send back to user when congestion abates |
22d85c79 | 499 | * Does not consume buffer list |
b97bf3fd | 500 | */ |
3127a020 | 501 | static int link_schedule_user(struct tipc_link *link, struct sk_buff_head *list) |
b97bf3fd | 502 | { |
3127a020 JPM |
503 | struct tipc_msg *msg = buf_msg(skb_peek(list)); |
504 | int imp = msg_importance(msg); | |
505 | u32 oport = msg_origport(msg); | |
506 | u32 addr = link_own_addr(link); | |
507 | struct sk_buff *skb; | |
508 | ||
509 | /* This really cannot happen... */ | |
510 | if (unlikely(imp > TIPC_CRITICAL_IMPORTANCE)) { | |
511 | pr_warn("%s<%s>, send queue full", link_rst_msg, link->name); | |
22d85c79 | 512 | return -ENOBUFS; |
3127a020 JPM |
513 | } |
514 | /* Non-blocking sender: */ | |
515 | if (TIPC_SKB_CB(skb_peek(list))->wakeup_pending) | |
516 | return -ELINKCONG; | |
517 | ||
518 | /* Create and schedule wakeup pseudo message */ | |
519 | skb = tipc_msg_create(SOCK_WAKEUP, 0, INT_H_SIZE, 0, | |
520 | addr, addr, oport, 0, 0); | |
521 | if (!skb) | |
22d85c79 | 522 | return -ENOBUFS; |
3127a020 JPM |
523 | TIPC_SKB_CB(skb)->chain_sz = skb_queue_len(list); |
524 | TIPC_SKB_CB(skb)->chain_imp = imp; | |
525 | skb_queue_tail(&link->wakeupq, skb); | |
50100a5e | 526 | link->stats.link_congs++; |
3127a020 | 527 | return -ELINKCONG; |
b97bf3fd PL |
528 | } |
529 | ||
50100a5e JPM |
530 | /** |
531 | * link_prepare_wakeup - prepare users for wakeup after congestion | |
532 | * @link: congested link | |
533 | * Move a number of waiting users, as permitted by available space in | |
534 | * the send queue, from link wait queue to node wait queue for wakeup | |
535 | */ | |
1f66d161 | 536 | void link_prepare_wakeup(struct tipc_link *l) |
b97bf3fd | 537 | { |
1f66d161 JPM |
538 | int pnd[TIPC_SYSTEM_IMPORTANCE + 1] = {0,}; |
539 | int imp, lim; | |
58d78b32 | 540 | struct sk_buff *skb, *tmp; |
50100a5e | 541 | |
1f66d161 JPM |
542 | skb_queue_walk_safe(&l->wakeupq, skb, tmp) { |
543 | imp = TIPC_SKB_CB(skb)->chain_imp; | |
544 | lim = l->window + l->backlog[imp].limit; | |
545 | pnd[imp] += TIPC_SKB_CB(skb)->chain_sz; | |
546 | if ((pnd[imp] + l->backlog[imp].len) >= lim) | |
b97bf3fd | 547 | break; |
1f66d161 | 548 | skb_unlink(skb, &l->wakeupq); |
d39bbd44 JPM |
549 | skb_queue_tail(l->inputq, skb); |
550 | l->owner->inputq = l->inputq; | |
1f66d161 | 551 | l->owner->action_flags |= TIPC_MSG_EVT; |
b97bf3fd | 552 | } |
b97bf3fd PL |
553 | } |
554 | ||
b97bf3fd | 555 | /** |
4323add6 | 556 | * tipc_link_reset_fragments - purge link's inbound message fragments queue |
b97bf3fd PL |
557 | * @l_ptr: pointer to link |
558 | */ | |
a18c4bc3 | 559 | void tipc_link_reset_fragments(struct tipc_link *l_ptr) |
b97bf3fd | 560 | { |
37e22164 JPM |
561 | kfree_skb(l_ptr->reasm_buf); |
562 | l_ptr->reasm_buf = NULL; | |
b97bf3fd PL |
563 | } |
564 | ||
7d967b67 | 565 | void tipc_link_purge_backlog(struct tipc_link *l) |
1f66d161 JPM |
566 | { |
567 | __skb_queue_purge(&l->backlogq); | |
568 | l->backlog[TIPC_LOW_IMPORTANCE].len = 0; | |
569 | l->backlog[TIPC_MEDIUM_IMPORTANCE].len = 0; | |
570 | l->backlog[TIPC_HIGH_IMPORTANCE].len = 0; | |
571 | l->backlog[TIPC_CRITICAL_IMPORTANCE].len = 0; | |
572 | l->backlog[TIPC_SYSTEM_IMPORTANCE].len = 0; | |
573 | } | |
574 | ||
c4307285 | 575 | /** |
581465fa | 576 | * tipc_link_purge_queues - purge all pkt queues associated with link |
b97bf3fd PL |
577 | * @l_ptr: pointer to link |
578 | */ | |
581465fa | 579 | void tipc_link_purge_queues(struct tipc_link *l_ptr) |
b97bf3fd | 580 | { |
05dcc5aa JPM |
581 | __skb_queue_purge(&l_ptr->deferdq); |
582 | __skb_queue_purge(&l_ptr->transmq); | |
1f66d161 | 583 | tipc_link_purge_backlog(l_ptr); |
4323add6 | 584 | tipc_link_reset_fragments(l_ptr); |
b97bf3fd PL |
585 | } |
586 | ||
a18c4bc3 | 587 | void tipc_link_reset(struct tipc_link *l_ptr) |
b97bf3fd | 588 | { |
b97bf3fd | 589 | u32 prev_state = l_ptr->state; |
5392d646 | 590 | int was_active_link = tipc_link_is_active(l_ptr); |
50100a5e | 591 | struct tipc_node *owner = l_ptr->owner; |
dff29b1a | 592 | struct tipc_link *pl = tipc_parallel_link(l_ptr); |
c4307285 | 593 | |
a686e685 | 594 | msg_set_session(l_ptr->pmsg, ((msg_session(l_ptr->pmsg) + 1) & 0xffff)); |
b97bf3fd | 595 | |
a686e685 | 596 | /* Link is down, accept any session */ |
d3504c34 | 597 | l_ptr->peer_session = WILDCARD_SESSION; |
b97bf3fd | 598 | |
ed193ece JPM |
599 | /* Prepare for renewed mtu size negotiation */ |
600 | l_ptr->mtu = l_ptr->advertised_mtu; | |
c4307285 | 601 | |
6ab30f9c | 602 | l_ptr->state = TIPC_LINK_RESETTING; |
b97bf3fd | 603 | |
6ab30f9c JPM |
604 | if ((prev_state == TIPC_LINK_RESETTING) || |
605 | (prev_state == TIPC_LINK_ESTABLISHING)) | |
b97bf3fd PL |
606 | return; |
607 | ||
9d13ec65 | 608 | tipc_node_link_down(l_ptr->owner, l_ptr->bearer_id); |
7f9f95d9 | 609 | tipc_bearer_remove_dest(owner->net, l_ptr->bearer_id, l_ptr->addr); |
7368ddf1 | 610 | |
dff29b1a | 611 | if (was_active_link && tipc_node_is_up(l_ptr->owner) && (pl != l_ptr)) { |
d3504c34 | 612 | l_ptr->exec_mode = TIPC_LINK_BLOCKED; |
a97b9d3f | 613 | l_ptr->failover_checkpt = l_ptr->rcv_nxt; |
dff29b1a | 614 | pl->failover_pkts = FIRST_FAILOVER; |
a97b9d3f | 615 | pl->failover_checkpt = l_ptr->rcv_nxt; |
dff29b1a JPM |
616 | pl->failover_skb = l_ptr->reasm_buf; |
617 | } else { | |
618 | kfree_skb(l_ptr->reasm_buf); | |
b97bf3fd | 619 | } |
c637c103 | 620 | /* Clean up all queues, except inputq: */ |
05dcc5aa | 621 | __skb_queue_purge(&l_ptr->transmq); |
05dcc5aa | 622 | __skb_queue_purge(&l_ptr->deferdq); |
e6441bae | 623 | if (!owner->inputq) |
d39bbd44 | 624 | owner->inputq = l_ptr->inputq; |
e6441bae JPM |
625 | skb_queue_splice_init(&l_ptr->wakeupq, owner->inputq); |
626 | if (!skb_queue_empty(owner->inputq)) | |
c637c103 | 627 | owner->action_flags |= TIPC_MSG_EVT; |
1f66d161 | 628 | tipc_link_purge_backlog(l_ptr); |
dff29b1a | 629 | l_ptr->reasm_buf = NULL; |
05dcc5aa | 630 | l_ptr->rcv_unacked = 0; |
a97b9d3f | 631 | l_ptr->snd_nxt = 1; |
d999297c | 632 | l_ptr->rcv_nxt = 1; |
a97b9d3f | 633 | l_ptr->silent_intv_cnt = 0; |
d999297c | 634 | l_ptr->stats.recv_info = 0; |
b97bf3fd PL |
635 | l_ptr->stale_count = 0; |
636 | link_reset_statistics(l_ptr); | |
b97bf3fd PL |
637 | } |
638 | ||
d999297c | 639 | void tipc_link_activate(struct tipc_link *link) |
b97bf3fd | 640 | { |
7f9f95d9 YX |
641 | struct tipc_node *node = link->owner; |
642 | ||
a97b9d3f | 643 | link->rcv_nxt = 1; |
7f9f95d9 | 644 | link->stats.recv_info = 1; |
cd4eee3c | 645 | link->silent_intv_cnt = 0; |
6ab30f9c JPM |
646 | link->state = TIPC_LINK_WORKING; |
647 | link->exec_mode = TIPC_LINK_OPEN; | |
9d13ec65 | 648 | tipc_node_link_up(node, link->bearer_id); |
7f9f95d9 | 649 | tipc_bearer_add_dest(node->net, link->bearer_id, link->addr); |
b97bf3fd PL |
650 | } |
651 | ||
4f1688b2 | 652 | /** |
9fbfb8b1 | 653 | * __tipc_link_xmit(): same as tipc_link_xmit, but destlink is known & locked |
4f1688b2 | 654 | * @link: link to use |
a6ca1094 YX |
655 | * @list: chain of buffers containing message |
656 | * | |
22d85c79 | 657 | * Consumes the buffer chain, except when returning an error code, |
3127a020 JPM |
658 | * Returns 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS |
659 | * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted | |
4f1688b2 | 660 | */ |
7f9f95d9 YX |
661 | int __tipc_link_xmit(struct net *net, struct tipc_link *link, |
662 | struct sk_buff_head *list) | |
4f1688b2 | 663 | { |
a6ca1094 | 664 | struct tipc_msg *msg = buf_msg(skb_peek(list)); |
05dcc5aa | 665 | unsigned int maxwin = link->window; |
f21e897e | 666 | unsigned int i, imp = msg_importance(msg); |
ed193ece | 667 | uint mtu = link->mtu; |
a97b9d3f JPM |
668 | u16 ack = mod(link->rcv_nxt - 1); |
669 | u16 seqno = link->snd_nxt; | |
e4bf4f76 | 670 | u16 bc_last_in = link->owner->bclink.last_in; |
4f1688b2 | 671 | struct tipc_media_addr *addr = &link->media_addr; |
05dcc5aa JPM |
672 | struct sk_buff_head *transmq = &link->transmq; |
673 | struct sk_buff_head *backlogq = &link->backlogq; | |
dd3f9e70 | 674 | struct sk_buff *skb, *bskb; |
4f1688b2 | 675 | |
f21e897e JPM |
676 | /* Match msg importance against this and all higher backlog limits: */ |
677 | for (i = imp; i <= TIPC_SYSTEM_IMPORTANCE; i++) { | |
678 | if (unlikely(link->backlog[i].len >= link->backlog[i].limit)) | |
679 | return link_schedule_user(link, list); | |
680 | } | |
22d85c79 | 681 | if (unlikely(msg_size(msg) > mtu)) |
4f1688b2 | 682 | return -EMSGSIZE; |
22d85c79 | 683 | |
05dcc5aa | 684 | /* Prepare each packet for sending, and add to relevant queue: */ |
dd3f9e70 JPM |
685 | while (skb_queue_len(list)) { |
686 | skb = skb_peek(list); | |
58dc55f2 | 687 | msg = buf_msg(skb); |
05dcc5aa JPM |
688 | msg_set_seqno(msg, seqno); |
689 | msg_set_ack(msg, ack); | |
4f1688b2 JPM |
690 | msg_set_bcast_ack(msg, bc_last_in); |
691 | ||
05dcc5aa | 692 | if (likely(skb_queue_len(transmq) < maxwin)) { |
dd3f9e70 | 693 | __skb_dequeue(list); |
05dcc5aa JPM |
694 | __skb_queue_tail(transmq, skb); |
695 | tipc_bearer_send(net, link->bearer_id, skb, addr); | |
696 | link->rcv_unacked = 0; | |
697 | seqno++; | |
698 | continue; | |
699 | } | |
dd3f9e70 JPM |
700 | if (tipc_msg_bundle(skb_peek_tail(backlogq), msg, mtu)) { |
701 | kfree_skb(__skb_dequeue(list)); | |
4f1688b2 | 702 | link->stats.sent_bundled++; |
4f1688b2 | 703 | continue; |
05dcc5aa | 704 | } |
dd3f9e70 JPM |
705 | if (tipc_msg_make_bundle(&bskb, msg, mtu, link->addr)) { |
706 | kfree_skb(__skb_dequeue(list)); | |
707 | __skb_queue_tail(backlogq, bskb); | |
708 | link->backlog[msg_importance(buf_msg(bskb))].len++; | |
4f1688b2 JPM |
709 | link->stats.sent_bundled++; |
710 | link->stats.sent_bundles++; | |
dd3f9e70 | 711 | continue; |
4f1688b2 | 712 | } |
dd3f9e70 JPM |
713 | link->backlog[imp].len += skb_queue_len(list); |
714 | skb_queue_splice_tail_init(list, backlogq); | |
4f1688b2 | 715 | } |
a97b9d3f | 716 | link->snd_nxt = seqno; |
4f1688b2 JPM |
717 | return 0; |
718 | } | |
719 | ||
af9b028e JPM |
720 | /** |
721 | * tipc_link_xmit(): enqueue buffer list according to queue situation | |
722 | * @link: link to use | |
723 | * @list: chain of buffers containing message | |
724 | * @xmitq: returned list of packets to be sent by caller | |
725 | * | |
726 | * Consumes the buffer chain, except when returning -ELINKCONG, | |
727 | * since the caller then may want to make more send attempts. | |
728 | * Returns 0 if success, or errno: -ELINKCONG, -EMSGSIZE or -ENOBUFS | |
729 | * Messages at TIPC_SYSTEM_IMPORTANCE are always accepted | |
730 | */ | |
731 | int tipc_link_xmit(struct tipc_link *l, struct sk_buff_head *list, | |
732 | struct sk_buff_head *xmitq) | |
733 | { | |
734 | struct tipc_msg *hdr = buf_msg(skb_peek(list)); | |
735 | unsigned int maxwin = l->window; | |
736 | unsigned int i, imp = msg_importance(hdr); | |
737 | unsigned int mtu = l->mtu; | |
738 | u16 ack = l->rcv_nxt - 1; | |
739 | u16 seqno = l->snd_nxt; | |
740 | u16 bc_last_in = l->owner->bclink.last_in; | |
741 | struct sk_buff_head *transmq = &l->transmq; | |
742 | struct sk_buff_head *backlogq = &l->backlogq; | |
743 | struct sk_buff *skb, *_skb, *bskb; | |
744 | ||
745 | /* Match msg importance against this and all higher backlog limits: */ | |
746 | for (i = imp; i <= TIPC_SYSTEM_IMPORTANCE; i++) { | |
747 | if (unlikely(l->backlog[i].len >= l->backlog[i].limit)) | |
748 | return link_schedule_user(l, list); | |
749 | } | |
750 | if (unlikely(msg_size(hdr) > mtu)) | |
751 | return -EMSGSIZE; | |
752 | ||
753 | /* Prepare each packet for sending, and add to relevant queue: */ | |
754 | while (skb_queue_len(list)) { | |
755 | skb = skb_peek(list); | |
756 | hdr = buf_msg(skb); | |
757 | msg_set_seqno(hdr, seqno); | |
758 | msg_set_ack(hdr, ack); | |
759 | msg_set_bcast_ack(hdr, bc_last_in); | |
760 | ||
761 | if (likely(skb_queue_len(transmq) < maxwin)) { | |
762 | _skb = skb_clone(skb, GFP_ATOMIC); | |
763 | if (!_skb) | |
764 | return -ENOBUFS; | |
765 | __skb_dequeue(list); | |
766 | __skb_queue_tail(transmq, skb); | |
767 | __skb_queue_tail(xmitq, _skb); | |
768 | l->rcv_unacked = 0; | |
769 | seqno++; | |
770 | continue; | |
771 | } | |
772 | if (tipc_msg_bundle(skb_peek_tail(backlogq), hdr, mtu)) { | |
773 | kfree_skb(__skb_dequeue(list)); | |
774 | l->stats.sent_bundled++; | |
775 | continue; | |
776 | } | |
777 | if (tipc_msg_make_bundle(&bskb, hdr, mtu, l->addr)) { | |
778 | kfree_skb(__skb_dequeue(list)); | |
779 | __skb_queue_tail(backlogq, bskb); | |
780 | l->backlog[msg_importance(buf_msg(bskb))].len++; | |
781 | l->stats.sent_bundled++; | |
782 | l->stats.sent_bundles++; | |
783 | continue; | |
784 | } | |
785 | l->backlog[imp].len += skb_queue_len(list); | |
786 | skb_queue_splice_tail_init(list, backlogq); | |
787 | } | |
788 | l->snd_nxt = seqno; | |
789 | return 0; | |
790 | } | |
791 | ||
a6ca1094 YX |
792 | static void skb2list(struct sk_buff *skb, struct sk_buff_head *list) |
793 | { | |
c637c103 | 794 | skb_queue_head_init(list); |
a6ca1094 YX |
795 | __skb_queue_tail(list, skb); |
796 | } | |
797 | ||
798 | static int __tipc_link_xmit_skb(struct tipc_link *link, struct sk_buff *skb) | |
799 | { | |
800 | struct sk_buff_head head; | |
801 | ||
802 | skb2list(skb, &head); | |
7f9f95d9 | 803 | return __tipc_link_xmit(link->owner->net, link, &head); |
a6ca1094 YX |
804 | } |
805 | ||
c64f7a6a | 806 | /* |
247f0f3c | 807 | * tipc_link_sync_rcv - synchronize broadcast link endpoints. |
c64f7a6a JM |
808 | * Receive the sequence number where we should start receiving and |
809 | * acking broadcast packets from a newly added peer node, and open | |
810 | * up for reception of such packets. | |
811 | * | |
812 | * Called with node locked | |
813 | */ | |
247f0f3c | 814 | static void tipc_link_sync_rcv(struct tipc_node *n, struct sk_buff *buf) |
c64f7a6a JM |
815 | { |
816 | struct tipc_msg *msg = buf_msg(buf); | |
817 | ||
818 | n->bclink.last_sent = n->bclink.last_in = msg_last_bcast(msg); | |
819 | n->bclink.recv_permitted = true; | |
820 | kfree_skb(buf); | |
821 | } | |
822 | ||
c4307285 | 823 | /* |
47b4c9a8 YX |
824 | * tipc_link_push_packets - push unsent packets to bearer |
825 | * | |
826 | * Push out the unsent messages of a link where congestion | |
827 | * has abated. Node is locked. | |
828 | * | |
829 | * Called with node locked | |
b97bf3fd | 830 | */ |
05dcc5aa | 831 | void tipc_link_push_packets(struct tipc_link *link) |
b97bf3fd | 832 | { |
05dcc5aa | 833 | struct sk_buff *skb; |
47b4c9a8 | 834 | struct tipc_msg *msg; |
dd3f9e70 | 835 | u16 seqno = link->snd_nxt; |
a97b9d3f | 836 | u16 ack = mod(link->rcv_nxt - 1); |
b97bf3fd | 837 | |
05dcc5aa JPM |
838 | while (skb_queue_len(&link->transmq) < link->window) { |
839 | skb = __skb_dequeue(&link->backlogq); | |
840 | if (!skb) | |
47b4c9a8 | 841 | break; |
05dcc5aa | 842 | msg = buf_msg(skb); |
1f66d161 | 843 | link->backlog[msg_importance(msg)].len--; |
05dcc5aa | 844 | msg_set_ack(msg, ack); |
dd3f9e70 JPM |
845 | msg_set_seqno(msg, seqno); |
846 | seqno = mod(seqno + 1); | |
05dcc5aa JPM |
847 | msg_set_bcast_ack(msg, link->owner->bclink.last_in); |
848 | link->rcv_unacked = 0; | |
849 | __skb_queue_tail(&link->transmq, skb); | |
850 | tipc_bearer_send(link->owner->net, link->bearer_id, | |
851 | skb, &link->media_addr); | |
b97bf3fd | 852 | } |
dd3f9e70 | 853 | link->snd_nxt = seqno; |
b97bf3fd PL |
854 | } |
855 | ||
d999297c JPM |
856 | void tipc_link_advance_backlog(struct tipc_link *l, struct sk_buff_head *xmitq) |
857 | { | |
858 | struct sk_buff *skb, *_skb; | |
859 | struct tipc_msg *hdr; | |
860 | u16 seqno = l->snd_nxt; | |
861 | u16 ack = l->rcv_nxt - 1; | |
862 | ||
863 | while (skb_queue_len(&l->transmq) < l->window) { | |
864 | skb = skb_peek(&l->backlogq); | |
865 | if (!skb) | |
866 | break; | |
867 | _skb = skb_clone(skb, GFP_ATOMIC); | |
868 | if (!_skb) | |
869 | break; | |
870 | __skb_dequeue(&l->backlogq); | |
871 | hdr = buf_msg(skb); | |
872 | l->backlog[msg_importance(hdr)].len--; | |
873 | __skb_queue_tail(&l->transmq, skb); | |
874 | __skb_queue_tail(xmitq, _skb); | |
875 | msg_set_ack(hdr, ack); | |
876 | msg_set_seqno(hdr, seqno); | |
877 | msg_set_bcast_ack(hdr, l->owner->bclink.last_in); | |
878 | l->rcv_unacked = 0; | |
879 | seqno++; | |
880 | } | |
881 | l->snd_nxt = seqno; | |
882 | } | |
883 | ||
3f5a12bd | 884 | void tipc_link_reset_all(struct tipc_node *node) |
d356eeba | 885 | { |
d356eeba AS |
886 | char addr_string[16]; |
887 | u32 i; | |
888 | ||
3f5a12bd | 889 | tipc_node_lock(node); |
d356eeba | 890 | |
2cf8aa19 | 891 | pr_warn("Resetting all links to %s\n", |
3f5a12bd | 892 | tipc_addr_string_fill(addr_string, node->addr)); |
d356eeba AS |
893 | |
894 | for (i = 0; i < MAX_BEARERS; i++) { | |
9d13ec65 JPM |
895 | if (node->links[i].link) { |
896 | link_print(node->links[i].link, "Resetting link\n"); | |
897 | tipc_link_reset(node->links[i].link); | |
d356eeba AS |
898 | } |
899 | } | |
900 | ||
3f5a12bd | 901 | tipc_node_unlock(node); |
d356eeba AS |
902 | } |
903 | ||
a18c4bc3 | 904 | static void link_retransmit_failure(struct tipc_link *l_ptr, |
ae8509c4 | 905 | struct sk_buff *buf) |
d356eeba AS |
906 | { |
907 | struct tipc_msg *msg = buf_msg(buf); | |
1da46568 | 908 | struct net *net = l_ptr->owner->net; |
d356eeba | 909 | |
2cf8aa19 | 910 | pr_warn("Retransmission failure on link <%s>\n", l_ptr->name); |
d356eeba AS |
911 | |
912 | if (l_ptr->addr) { | |
d356eeba | 913 | /* Handle failure on standard link */ |
1a20cc25 JPM |
914 | link_print(l_ptr, "Resetting link "); |
915 | pr_info("Failed msg: usr %u, typ %u, len %u, err %u\n", | |
916 | msg_user(msg), msg_type(msg), msg_size(msg), | |
917 | msg_errcode(msg)); | |
918 | pr_info("sqno %u, prev: %x, src: %x\n", | |
919 | msg_seqno(msg), msg_prevnode(msg), msg_orignode(msg)); | |
d356eeba | 920 | tipc_link_reset(l_ptr); |
d356eeba | 921 | } else { |
d356eeba | 922 | /* Handle failure on broadcast link */ |
6c00055a | 923 | struct tipc_node *n_ptr; |
d356eeba AS |
924 | char addr_string[16]; |
925 | ||
2cf8aa19 EH |
926 | pr_info("Msg seq number: %u, ", msg_seqno(msg)); |
927 | pr_cont("Outstanding acks: %lu\n", | |
928 | (unsigned long) TIPC_SKB_CB(buf)->handle); | |
617dbeaa | 929 | |
1da46568 | 930 | n_ptr = tipc_bclink_retransmit_to(net); |
d356eeba | 931 | |
c68ca7b7 | 932 | tipc_addr_string_fill(addr_string, n_ptr->addr); |
2cf8aa19 | 933 | pr_info("Broadcast link info for %s\n", addr_string); |
389dd9bc YX |
934 | pr_info("Reception permitted: %d, Acked: %u\n", |
935 | n_ptr->bclink.recv_permitted, | |
2cf8aa19 EH |
936 | n_ptr->bclink.acked); |
937 | pr_info("Last in: %u, Oos state: %u, Last sent: %u\n", | |
938 | n_ptr->bclink.last_in, | |
939 | n_ptr->bclink.oos_state, | |
940 | n_ptr->bclink.last_sent); | |
d356eeba | 941 | |
b952b2be | 942 | n_ptr->action_flags |= TIPC_BCAST_RESET; |
d356eeba AS |
943 | l_ptr->stale_count = 0; |
944 | } | |
945 | } | |
946 | ||
58dc55f2 | 947 | void tipc_link_retransmit(struct tipc_link *l_ptr, struct sk_buff *skb, |
4323add6 | 948 | u32 retransmits) |
b97bf3fd PL |
949 | { |
950 | struct tipc_msg *msg; | |
951 | ||
58dc55f2 | 952 | if (!skb) |
d356eeba AS |
953 | return; |
954 | ||
58dc55f2 | 955 | msg = buf_msg(skb); |
c4307285 | 956 | |
512137ee | 957 | /* Detect repeated retransmit failures */ |
a97b9d3f | 958 | if (l_ptr->last_retransm == msg_seqno(msg)) { |
512137ee | 959 | if (++l_ptr->stale_count > 100) { |
58dc55f2 | 960 | link_retransmit_failure(l_ptr, skb); |
512137ee | 961 | return; |
d356eeba AS |
962 | } |
963 | } else { | |
a97b9d3f | 964 | l_ptr->last_retransm = msg_seqno(msg); |
512137ee | 965 | l_ptr->stale_count = 1; |
b97bf3fd | 966 | } |
d356eeba | 967 | |
05dcc5aa JPM |
968 | skb_queue_walk_from(&l_ptr->transmq, skb) { |
969 | if (!retransmits) | |
58dc55f2 YX |
970 | break; |
971 | msg = buf_msg(skb); | |
a97b9d3f | 972 | msg_set_ack(msg, mod(l_ptr->rcv_nxt - 1)); |
c4307285 | 973 | msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in); |
7f9f95d9 YX |
974 | tipc_bearer_send(l_ptr->owner->net, l_ptr->bearer_id, skb, |
975 | &l_ptr->media_addr); | |
3c294cb3 YX |
976 | retransmits--; |
977 | l_ptr->stats.retransmitted++; | |
b97bf3fd | 978 | } |
b97bf3fd PL |
979 | } |
980 | ||
d999297c JPM |
981 | static int tipc_link_retransm(struct tipc_link *l, int retransm, |
982 | struct sk_buff_head *xmitq) | |
983 | { | |
984 | struct sk_buff *_skb, *skb = skb_peek(&l->transmq); | |
985 | struct tipc_msg *hdr; | |
986 | ||
987 | if (!skb) | |
988 | return 0; | |
989 | ||
990 | /* Detect repeated retransmit failures on same packet */ | |
991 | if (likely(l->last_retransm != buf_seqno(skb))) { | |
992 | l->last_retransm = buf_seqno(skb); | |
993 | l->stale_count = 1; | |
994 | } else if (++l->stale_count > 100) { | |
995 | link_retransmit_failure(l, skb); | |
996 | return TIPC_LINK_DOWN_EVT; | |
997 | } | |
998 | skb_queue_walk(&l->transmq, skb) { | |
999 | if (!retransm) | |
1000 | return 0; | |
1001 | hdr = buf_msg(skb); | |
1002 | _skb = __pskb_copy(skb, MIN_H_SIZE, GFP_ATOMIC); | |
1003 | if (!_skb) | |
1004 | return 0; | |
1005 | hdr = buf_msg(_skb); | |
1006 | msg_set_ack(hdr, l->rcv_nxt - 1); | |
1007 | msg_set_bcast_ack(hdr, l->owner->bclink.last_in); | |
1008 | _skb->priority = TC_PRIO_CONTROL; | |
1009 | __skb_queue_tail(xmitq, _skb); | |
1010 | retransm--; | |
1011 | l->stats.retransmitted++; | |
1012 | } | |
1013 | return 0; | |
1014 | } | |
1015 | ||
8b4ed863 JPM |
1016 | /* link_synch(): check if all packets arrived before the synch |
1017 | * point have been consumed | |
1018 | * Returns true if the parallel links are synched, otherwise false | |
1019 | */ | |
1020 | static bool link_synch(struct tipc_link *l) | |
1021 | { | |
1022 | unsigned int post_synch; | |
1023 | struct tipc_link *pl; | |
1024 | ||
1025 | pl = tipc_parallel_link(l); | |
1026 | if (pl == l) | |
1027 | goto synched; | |
1028 | ||
1029 | /* Was last pre-synch packet added to input queue ? */ | |
a97b9d3f | 1030 | if (less_eq(pl->rcv_nxt, l->synch_point)) |
8b4ed863 JPM |
1031 | return false; |
1032 | ||
1033 | /* Is it still in the input queue ? */ | |
a97b9d3f | 1034 | post_synch = mod(pl->rcv_nxt - l->synch_point) - 1; |
d39bbd44 | 1035 | if (skb_queue_len(pl->inputq) > post_synch) |
8b4ed863 JPM |
1036 | return false; |
1037 | synched: | |
d3504c34 | 1038 | l->exec_mode = TIPC_LINK_OPEN; |
8b4ed863 JPM |
1039 | return true; |
1040 | } | |
1041 | ||
c637c103 | 1042 | /* tipc_data_input - deliver data and name distr msgs to upper layer |
7ae934be | 1043 | * |
c637c103 | 1044 | * Consumes buffer if message is of right type |
7ae934be EH |
1045 | * Node lock must be held |
1046 | */ | |
c637c103 | 1047 | static bool tipc_data_input(struct tipc_link *link, struct sk_buff *skb) |
7ae934be | 1048 | { |
c637c103 JPM |
1049 | struct tipc_node *node = link->owner; |
1050 | struct tipc_msg *msg = buf_msg(skb); | |
1051 | u32 dport = msg_destport(msg); | |
7ae934be | 1052 | |
7ae934be | 1053 | switch (msg_user(msg)) { |
c637c103 JPM |
1054 | case TIPC_LOW_IMPORTANCE: |
1055 | case TIPC_MEDIUM_IMPORTANCE: | |
1056 | case TIPC_HIGH_IMPORTANCE: | |
1057 | case TIPC_CRITICAL_IMPORTANCE: | |
1058 | case CONN_MANAGER: | |
d39bbd44 JPM |
1059 | if (tipc_skb_queue_tail(link->inputq, skb, dport)) { |
1060 | node->inputq = link->inputq; | |
c637c103 | 1061 | node->action_flags |= TIPC_MSG_EVT; |
7ae934be | 1062 | } |
c637c103 | 1063 | return true; |
7ae934be | 1064 | case NAME_DISTRIBUTOR: |
c637c103 | 1065 | node->bclink.recv_permitted = true; |
d39bbd44 JPM |
1066 | node->namedq = link->namedq; |
1067 | skb_queue_tail(link->namedq, skb); | |
1068 | if (skb_queue_len(link->namedq) == 1) | |
c637c103 JPM |
1069 | node->action_flags |= TIPC_NAMED_MSG_EVT; |
1070 | return true; | |
1071 | case MSG_BUNDLER: | |
dff29b1a | 1072 | case TUNNEL_PROTOCOL: |
c637c103 | 1073 | case MSG_FRAGMENTER: |
7ae934be | 1074 | case BCAST_PROTOCOL: |
c637c103 | 1075 | return false; |
7ae934be | 1076 | default: |
c637c103 JPM |
1077 | pr_warn("Dropping received illegal msg type\n"); |
1078 | kfree_skb(skb); | |
1079 | return false; | |
1080 | }; | |
7ae934be | 1081 | } |
c637c103 JPM |
1082 | |
1083 | /* tipc_link_input - process packet that has passed link protocol check | |
1084 | * | |
1085 | * Consumes buffer | |
1086 | * Node lock must be held | |
7ae934be | 1087 | */ |
c637c103 | 1088 | static void tipc_link_input(struct tipc_link *link, struct sk_buff *skb) |
7ae934be | 1089 | { |
c637c103 JPM |
1090 | struct tipc_node *node = link->owner; |
1091 | struct tipc_msg *msg = buf_msg(skb); | |
1092 | struct sk_buff *iskb; | |
1093 | int pos = 0; | |
1094 | ||
7ae934be | 1095 | switch (msg_user(msg)) { |
dff29b1a | 1096 | case TUNNEL_PROTOCOL: |
8b4ed863 | 1097 | if (msg_dup(msg)) { |
d3504c34 | 1098 | link->exec_mode = TIPC_LINK_TUNNEL; |
8b4ed863 | 1099 | link->synch_point = msg_seqno(msg_get_wrapped(msg)); |
2da71425 JPM |
1100 | kfree_skb(skb); |
1101 | break; | |
8b4ed863 | 1102 | } |
dff29b1a | 1103 | if (!tipc_link_failover_rcv(link, &skb)) |
c637c103 JPM |
1104 | break; |
1105 | if (msg_user(buf_msg(skb)) != MSG_BUNDLER) { | |
1106 | tipc_data_input(link, skb); | |
1107 | break; | |
1108 | } | |
1109 | case MSG_BUNDLER: | |
1110 | link->stats.recv_bundles++; | |
1111 | link->stats.recv_bundled += msg_msgcnt(msg); | |
1112 | ||
1113 | while (tipc_msg_extract(skb, &iskb, &pos)) | |
1114 | tipc_data_input(link, iskb); | |
7ae934be | 1115 | break; |
c637c103 JPM |
1116 | case MSG_FRAGMENTER: |
1117 | link->stats.recv_fragments++; | |
1118 | if (tipc_buf_append(&link->reasm_buf, &skb)) { | |
1119 | link->stats.recv_fragmented++; | |
1120 | tipc_data_input(link, skb); | |
1121 | } else if (!link->reasm_buf) { | |
1122 | tipc_link_reset(link); | |
1123 | } | |
7ae934be | 1124 | break; |
c637c103 JPM |
1125 | case BCAST_PROTOCOL: |
1126 | tipc_link_sync_rcv(node, skb); | |
7ae934be EH |
1127 | break; |
1128 | default: | |
c637c103 JPM |
1129 | break; |
1130 | }; | |
7ae934be EH |
1131 | } |
1132 | ||
d999297c JPM |
1133 | static bool tipc_link_release_pkts(struct tipc_link *l, u16 acked) |
1134 | { | |
1135 | bool released = false; | |
1136 | struct sk_buff *skb, *tmp; | |
1137 | ||
1138 | skb_queue_walk_safe(&l->transmq, skb, tmp) { | |
1139 | if (more(buf_seqno(skb), acked)) | |
1140 | break; | |
1141 | __skb_unlink(skb, &l->transmq); | |
1142 | kfree_skb(skb); | |
1143 | released = true; | |
1144 | } | |
1145 | return released; | |
1146 | } | |
1147 | ||
1148 | /* tipc_link_rcv - process TIPC packets/messages arriving from off-node | |
1149 | * @link: the link that should handle the message | |
1150 | * @skb: TIPC packet | |
1151 | * @xmitq: queue to place packets to be sent after this call | |
1152 | */ | |
1153 | int tipc_link_rcv(struct tipc_link *l, struct sk_buff *skb, | |
1154 | struct sk_buff_head *xmitq) | |
1155 | { | |
1156 | struct sk_buff_head *arrvq = &l->deferdq; | |
1157 | struct sk_buff *tmp; | |
1158 | struct tipc_msg *hdr; | |
1159 | u16 seqno, rcv_nxt; | |
1160 | int rc = 0; | |
1161 | ||
1162 | if (unlikely(!__tipc_skb_queue_sorted(arrvq, skb))) { | |
1163 | if (!(skb_queue_len(arrvq) % TIPC_NACK_INTV)) | |
1164 | tipc_link_build_proto_msg(l, STATE_MSG, 0, | |
1165 | 0, 0, 0, xmitq); | |
1166 | return rc; | |
1167 | } | |
1168 | ||
1169 | skb_queue_walk_safe(arrvq, skb, tmp) { | |
1170 | hdr = buf_msg(skb); | |
1171 | ||
1172 | /* Verify and update link state */ | |
1173 | if (unlikely(msg_user(hdr) == LINK_PROTOCOL)) { | |
1174 | __skb_dequeue(arrvq); | |
1175 | rc |= tipc_link_proto_rcv(l, skb, xmitq); | |
1176 | continue; | |
1177 | } | |
1178 | ||
1179 | if (unlikely(!link_working(l))) { | |
1180 | rc |= tipc_link_fsm_evt(l, TRAFFIC_EVT, xmitq); | |
1181 | if (!link_working(l)) { | |
1182 | kfree_skb(__skb_dequeue(arrvq)); | |
1183 | return rc; | |
1184 | } | |
1185 | } | |
1186 | ||
1187 | l->silent_intv_cnt = 0; | |
1188 | ||
1189 | /* Forward queues and wake up waiting users */ | |
1190 | if (likely(tipc_link_release_pkts(l, msg_ack(hdr)))) { | |
1191 | tipc_link_advance_backlog(l, xmitq); | |
1192 | if (unlikely(!skb_queue_empty(&l->wakeupq))) | |
1193 | link_prepare_wakeup(l); | |
1194 | } | |
1195 | ||
1196 | /* Defer reception if there is a gap in the sequence */ | |
1197 | seqno = msg_seqno(hdr); | |
1198 | rcv_nxt = l->rcv_nxt; | |
1199 | if (unlikely(less(rcv_nxt, seqno))) { | |
1200 | l->stats.deferred_recv++; | |
1201 | return rc; | |
1202 | } | |
1203 | ||
1204 | __skb_dequeue(arrvq); | |
1205 | ||
1206 | /* Drop if packet already received */ | |
1207 | if (unlikely(more(rcv_nxt, seqno))) { | |
1208 | l->stats.duplicates++; | |
1209 | kfree_skb(skb); | |
1210 | return rc; | |
1211 | } | |
1212 | ||
1213 | /* Synchronize with parallel link if applicable */ | |
1214 | if (unlikely(l->exec_mode == TIPC_LINK_TUNNEL)) | |
1215 | if (!msg_dup(hdr) && !link_synch(l)) { | |
1216 | kfree_skb(skb); | |
1217 | return rc; | |
1218 | } | |
1219 | ||
1220 | /* Packet can be delivered */ | |
1221 | l->rcv_nxt++; | |
1222 | l->stats.recv_info++; | |
1223 | if (unlikely(!tipc_data_input(l, skb))) | |
1224 | tipc_link_input(l, skb); | |
1225 | ||
1226 | /* Ack at regular intervals */ | |
1227 | if (unlikely(++l->rcv_unacked >= TIPC_MIN_LINK_WIN)) { | |
1228 | l->rcv_unacked = 0; | |
1229 | l->stats.sent_acks++; | |
1230 | tipc_link_build_proto_msg(l, STATE_MSG, | |
1231 | 0, 0, 0, 0, xmitq); | |
1232 | } | |
1233 | } | |
1234 | return rc; | |
1235 | } | |
1236 | ||
2c53040f | 1237 | /** |
8809b255 AS |
1238 | * tipc_link_defer_pkt - Add out-of-sequence message to deferred reception queue |
1239 | * | |
1240 | * Returns increase in queue length (i.e. 0 or 1) | |
b97bf3fd | 1241 | */ |
bc6fecd4 | 1242 | u32 tipc_link_defer_pkt(struct sk_buff_head *list, struct sk_buff *skb) |
b97bf3fd | 1243 | { |
bc6fecd4 | 1244 | struct sk_buff *skb1; |
e4bf4f76 | 1245 | u16 seq_no = buf_seqno(skb); |
b97bf3fd PL |
1246 | |
1247 | /* Empty queue ? */ | |
bc6fecd4 YX |
1248 | if (skb_queue_empty(list)) { |
1249 | __skb_queue_tail(list, skb); | |
b97bf3fd PL |
1250 | return 1; |
1251 | } | |
1252 | ||
1253 | /* Last ? */ | |
bc6fecd4 YX |
1254 | if (less(buf_seqno(skb_peek_tail(list)), seq_no)) { |
1255 | __skb_queue_tail(list, skb); | |
b97bf3fd PL |
1256 | return 1; |
1257 | } | |
1258 | ||
8809b255 | 1259 | /* Locate insertion point in queue, then insert; discard if duplicate */ |
bc6fecd4 | 1260 | skb_queue_walk(list, skb1) { |
e4bf4f76 | 1261 | u16 curr_seqno = buf_seqno(skb1); |
b97bf3fd | 1262 | |
8809b255 | 1263 | if (seq_no == curr_seqno) { |
bc6fecd4 | 1264 | kfree_skb(skb); |
8809b255 | 1265 | return 0; |
b97bf3fd | 1266 | } |
8809b255 AS |
1267 | |
1268 | if (less(seq_no, curr_seqno)) | |
b97bf3fd | 1269 | break; |
8809b255 | 1270 | } |
b97bf3fd | 1271 | |
bc6fecd4 | 1272 | __skb_queue_before(list, skb1, skb); |
8809b255 | 1273 | return 1; |
b97bf3fd PL |
1274 | } |
1275 | ||
b97bf3fd PL |
1276 | /* |
1277 | * Send protocol message to the other endpoint. | |
1278 | */ | |
426cc2b8 | 1279 | void tipc_link_proto_xmit(struct tipc_link *l, u32 msg_typ, int probe_msg, |
ed193ece | 1280 | u32 gap, u32 tolerance, u32 priority) |
b97bf3fd | 1281 | { |
426cc2b8 JPM |
1282 | struct sk_buff *skb = NULL; |
1283 | struct sk_buff_head xmitq; | |
b97bf3fd | 1284 | |
426cc2b8 JPM |
1285 | __skb_queue_head_init(&xmitq); |
1286 | tipc_link_build_proto_msg(l, msg_typ, probe_msg, gap, | |
1287 | tolerance, priority, &xmitq); | |
1288 | skb = __skb_dequeue(&xmitq); | |
1289 | if (!skb) | |
b97bf3fd | 1290 | return; |
426cc2b8 JPM |
1291 | tipc_bearer_send(l->owner->net, l->bearer_id, skb, &l->media_addr); |
1292 | l->rcv_unacked = 0; | |
1293 | kfree_skb(skb); | |
b97bf3fd PL |
1294 | } |
1295 | ||
426cc2b8 JPM |
1296 | /* tipc_link_build_proto_msg: prepare link protocol message for transmission |
1297 | */ | |
1298 | static void tipc_link_build_proto_msg(struct tipc_link *l, int mtyp, bool probe, | |
1299 | u16 rcvgap, int tolerance, int priority, | |
1300 | struct sk_buff_head *xmitq) | |
1301 | { | |
1302 | struct sk_buff *skb = NULL; | |
1303 | struct tipc_msg *hdr = l->pmsg; | |
1304 | u16 snd_nxt = l->snd_nxt; | |
1305 | u16 rcv_nxt = l->rcv_nxt; | |
1306 | u16 rcv_last = rcv_nxt - 1; | |
1307 | int node_up = l->owner->bclink.recv_permitted; | |
1308 | ||
1309 | /* Don't send protocol message during reset or link failover */ | |
1310 | if (l->exec_mode == TIPC_LINK_BLOCKED) | |
1311 | return; | |
1312 | ||
426cc2b8 JPM |
1313 | msg_set_type(hdr, mtyp); |
1314 | msg_set_net_plane(hdr, l->net_plane); | |
1315 | msg_set_bcast_ack(hdr, l->owner->bclink.last_in); | |
1316 | msg_set_last_bcast(hdr, tipc_bclink_get_last_sent(l->owner->net)); | |
1317 | msg_set_link_tolerance(hdr, tolerance); | |
1318 | msg_set_linkprio(hdr, priority); | |
1319 | msg_set_redundant_link(hdr, node_up); | |
1320 | msg_set_seq_gap(hdr, 0); | |
1321 | ||
1322 | /* Compatibility: created msg must not be in sequence with pkt flow */ | |
1323 | msg_set_seqno(hdr, snd_nxt + U16_MAX / 2); | |
1324 | ||
1325 | if (mtyp == STATE_MSG) { | |
1326 | if (!tipc_link_is_up(l)) | |
1327 | return; | |
1328 | msg_set_next_sent(hdr, snd_nxt); | |
1329 | ||
1330 | /* Override rcvgap if there are packets in deferred queue */ | |
1331 | if (!skb_queue_empty(&l->deferdq)) | |
1332 | rcvgap = buf_seqno(skb_peek(&l->deferdq)) - rcv_nxt; | |
1333 | if (rcvgap) { | |
1334 | msg_set_seq_gap(hdr, rcvgap); | |
1335 | l->stats.sent_nacks++; | |
1336 | } | |
1337 | msg_set_ack(hdr, rcv_last); | |
1338 | msg_set_probe(hdr, probe); | |
1339 | if (probe) | |
1340 | l->stats.sent_probes++; | |
1341 | l->stats.sent_states++; | |
1342 | } else { | |
1343 | /* RESET_MSG or ACTIVATE_MSG */ | |
1344 | msg_set_max_pkt(hdr, l->advertised_mtu); | |
1345 | msg_set_ack(hdr, l->failover_checkpt - 1); | |
1346 | msg_set_next_sent(hdr, 1); | |
1347 | } | |
1348 | skb = tipc_buf_acquire(msg_size(hdr)); | |
1349 | if (!skb) | |
1350 | return; | |
1351 | skb_copy_to_linear_data(skb, hdr, msg_size(hdr)); | |
1352 | skb->priority = TC_PRIO_CONTROL; | |
1353 | __skb_queue_head(xmitq, skb); | |
1354 | } | |
b97bf3fd | 1355 | |
170b3927 JPM |
1356 | /* tipc_link_tunnel_xmit(): Tunnel one packet via a link belonging to |
1357 | * a different bearer. Owner node is locked. | |
b97bf3fd | 1358 | */ |
170b3927 JPM |
1359 | static void tipc_link_tunnel_xmit(struct tipc_link *l_ptr, |
1360 | struct tipc_msg *tunnel_hdr, | |
1361 | struct tipc_msg *msg, | |
1362 | u32 selector) | |
b97bf3fd | 1363 | { |
a18c4bc3 | 1364 | struct tipc_link *tunnel; |
a6ca1094 | 1365 | struct sk_buff *skb; |
b97bf3fd PL |
1366 | u32 length = msg_size(msg); |
1367 | ||
9d13ec65 | 1368 | tunnel = node_active_link(l_ptr->owner, selector & 1); |
5392d646 | 1369 | if (!tipc_link_is_up(tunnel)) { |
2cf8aa19 | 1370 | pr_warn("%stunnel link no longer available\n", link_co_err); |
b97bf3fd | 1371 | return; |
5392d646 | 1372 | } |
b97bf3fd | 1373 | msg_set_size(tunnel_hdr, length + INT_H_SIZE); |
a6ca1094 YX |
1374 | skb = tipc_buf_acquire(length + INT_H_SIZE); |
1375 | if (!skb) { | |
2cf8aa19 | 1376 | pr_warn("%sunable to send tunnel msg\n", link_co_err); |
b97bf3fd | 1377 | return; |
5392d646 | 1378 | } |
a6ca1094 YX |
1379 | skb_copy_to_linear_data(skb, tunnel_hdr, INT_H_SIZE); |
1380 | skb_copy_to_linear_data_offset(skb, INT_H_SIZE, msg, length); | |
1381 | __tipc_link_xmit_skb(tunnel, skb); | |
b97bf3fd PL |
1382 | } |
1383 | ||
1384 | ||
170b3927 JPM |
1385 | /* tipc_link_failover_send_queue(): A link has gone down, but a second |
1386 | * link is still active. We can do failover. Tunnel the failing link's | |
1387 | * whole send queue via the remaining link. This way, we don't lose | |
1388 | * any packets, and sequence order is preserved for subsequent traffic | |
1389 | * sent over the remaining link. Owner node is locked. | |
b97bf3fd | 1390 | */ |
170b3927 | 1391 | void tipc_link_failover_send_queue(struct tipc_link *l_ptr) |
b97bf3fd | 1392 | { |
05dcc5aa | 1393 | int msgcount; |
9d13ec65 | 1394 | struct tipc_link *tunnel = node_active_link(l_ptr->owner, 0); |
b97bf3fd | 1395 | struct tipc_msg tunnel_hdr; |
58dc55f2 | 1396 | struct sk_buff *skb; |
5392d646 | 1397 | int split_bundles; |
b97bf3fd PL |
1398 | |
1399 | if (!tunnel) | |
1400 | return; | |
1401 | ||
dff29b1a JPM |
1402 | tipc_msg_init(link_own_addr(l_ptr), &tunnel_hdr, TUNNEL_PROTOCOL, |
1403 | FAILOVER_MSG, INT_H_SIZE, l_ptr->addr); | |
dd3f9e70 JPM |
1404 | |
1405 | skb_queue_walk(&l_ptr->backlogq, skb) { | |
1406 | msg_set_seqno(buf_msg(skb), l_ptr->snd_nxt); | |
1407 | l_ptr->snd_nxt = mod(l_ptr->snd_nxt + 1); | |
1408 | } | |
05dcc5aa | 1409 | skb_queue_splice_tail_init(&l_ptr->backlogq, &l_ptr->transmq); |
1f66d161 | 1410 | tipc_link_purge_backlog(l_ptr); |
05dcc5aa | 1411 | msgcount = skb_queue_len(&l_ptr->transmq); |
b97bf3fd PL |
1412 | msg_set_bearer_id(&tunnel_hdr, l_ptr->peer_bearer_id); |
1413 | msg_set_msgcnt(&tunnel_hdr, msgcount); | |
f131072c | 1414 | |
05dcc5aa | 1415 | if (skb_queue_empty(&l_ptr->transmq)) { |
58dc55f2 YX |
1416 | skb = tipc_buf_acquire(INT_H_SIZE); |
1417 | if (skb) { | |
1418 | skb_copy_to_linear_data(skb, &tunnel_hdr, INT_H_SIZE); | |
b97bf3fd | 1419 | msg_set_size(&tunnel_hdr, INT_H_SIZE); |
a6ca1094 | 1420 | __tipc_link_xmit_skb(tunnel, skb); |
b97bf3fd | 1421 | } else { |
2cf8aa19 EH |
1422 | pr_warn("%sunable to send changeover msg\n", |
1423 | link_co_err); | |
b97bf3fd PL |
1424 | } |
1425 | return; | |
1426 | } | |
f131072c | 1427 | |
9d13ec65 JPM |
1428 | split_bundles = (node_active_link(l_ptr->owner, 0) != |
1429 | node_active_link(l_ptr->owner, 0)); | |
5392d646 | 1430 | |
05dcc5aa | 1431 | skb_queue_walk(&l_ptr->transmq, skb) { |
58dc55f2 | 1432 | struct tipc_msg *msg = buf_msg(skb); |
b97bf3fd PL |
1433 | |
1434 | if ((msg_user(msg) == MSG_BUNDLER) && split_bundles) { | |
b97bf3fd | 1435 | struct tipc_msg *m = msg_get_wrapped(msg); |
0e65967e | 1436 | unchar *pos = (unchar *)m; |
b97bf3fd | 1437 | |
d788d805 | 1438 | msgcount = msg_msgcnt(msg); |
b97bf3fd | 1439 | while (msgcount--) { |
0e65967e | 1440 | msg_set_seqno(m, msg_seqno(msg)); |
170b3927 JPM |
1441 | tipc_link_tunnel_xmit(l_ptr, &tunnel_hdr, m, |
1442 | msg_link_selector(m)); | |
b97bf3fd PL |
1443 | pos += align(msg_size(m)); |
1444 | m = (struct tipc_msg *)pos; | |
1445 | } | |
1446 | } else { | |
170b3927 JPM |
1447 | tipc_link_tunnel_xmit(l_ptr, &tunnel_hdr, msg, |
1448 | msg_link_selector(msg)); | |
b97bf3fd | 1449 | } |
b97bf3fd PL |
1450 | } |
1451 | } | |
1452 | ||
247f0f3c | 1453 | /* tipc_link_dup_queue_xmit(): A second link has become active. Tunnel a |
170b3927 JPM |
1454 | * duplicate of the first link's send queue via the new link. This way, we |
1455 | * are guaranteed that currently queued packets from a socket are delivered | |
1456 | * before future traffic from the same socket, even if this is using the | |
1457 | * new link. The last arriving copy of each duplicate packet is dropped at | |
1458 | * the receiving end by the regular protocol check, so packet cardinality | |
1459 | * and sequence order is preserved per sender/receiver socket pair. | |
1460 | * Owner node is locked. | |
1461 | */ | |
05dcc5aa JPM |
1462 | void tipc_link_dup_queue_xmit(struct tipc_link *link, |
1463 | struct tipc_link *tnl) | |
b97bf3fd | 1464 | { |
58dc55f2 | 1465 | struct sk_buff *skb; |
05dcc5aa JPM |
1466 | struct tipc_msg tnl_hdr; |
1467 | struct sk_buff_head *queue = &link->transmq; | |
1468 | int mcnt; | |
dd3f9e70 | 1469 | u16 seqno; |
05dcc5aa | 1470 | |
dff29b1a JPM |
1471 | tipc_msg_init(link_own_addr(link), &tnl_hdr, TUNNEL_PROTOCOL, |
1472 | SYNCH_MSG, INT_H_SIZE, link->addr); | |
05dcc5aa JPM |
1473 | mcnt = skb_queue_len(&link->transmq) + skb_queue_len(&link->backlogq); |
1474 | msg_set_msgcnt(&tnl_hdr, mcnt); | |
1475 | msg_set_bearer_id(&tnl_hdr, link->peer_bearer_id); | |
1476 | ||
1477 | tunnel_queue: | |
1478 | skb_queue_walk(queue, skb) { | |
58dc55f2 YX |
1479 | struct sk_buff *outskb; |
1480 | struct tipc_msg *msg = buf_msg(skb); | |
05dcc5aa | 1481 | u32 len = msg_size(msg); |
b97bf3fd | 1482 | |
a97b9d3f | 1483 | msg_set_ack(msg, mod(link->rcv_nxt - 1)); |
05dcc5aa JPM |
1484 | msg_set_bcast_ack(msg, link->owner->bclink.last_in); |
1485 | msg_set_size(&tnl_hdr, len + INT_H_SIZE); | |
1486 | outskb = tipc_buf_acquire(len + INT_H_SIZE); | |
58dc55f2 | 1487 | if (outskb == NULL) { |
2cf8aa19 EH |
1488 | pr_warn("%sunable to send duplicate msg\n", |
1489 | link_co_err); | |
b97bf3fd PL |
1490 | return; |
1491 | } | |
05dcc5aa JPM |
1492 | skb_copy_to_linear_data(outskb, &tnl_hdr, INT_H_SIZE); |
1493 | skb_copy_to_linear_data_offset(outskb, INT_H_SIZE, | |
1494 | skb->data, len); | |
1495 | __tipc_link_xmit_skb(tnl, outskb); | |
1496 | if (!tipc_link_is_up(link)) | |
b97bf3fd | 1497 | return; |
b97bf3fd | 1498 | } |
05dcc5aa JPM |
1499 | if (queue == &link->backlogq) |
1500 | return; | |
dd3f9e70 JPM |
1501 | seqno = link->snd_nxt; |
1502 | skb_queue_walk(&link->backlogq, skb) { | |
1503 | msg_set_seqno(buf_msg(skb), seqno); | |
1504 | seqno = mod(seqno + 1); | |
1505 | } | |
05dcc5aa JPM |
1506 | queue = &link->backlogq; |
1507 | goto tunnel_queue; | |
b97bf3fd PL |
1508 | } |
1509 | ||
dff29b1a | 1510 | /* tipc_link_failover_rcv(): Receive a tunnelled FAILOVER_MSG packet |
f006c9c7 JPM |
1511 | * Owner node is locked. |
1512 | */ | |
dff29b1a | 1513 | static bool tipc_link_failover_rcv(struct tipc_link *link, |
2da71425 | 1514 | struct sk_buff **skb) |
f006c9c7 | 1515 | { |
2da71425 JPM |
1516 | struct tipc_msg *msg = buf_msg(*skb); |
1517 | struct sk_buff *iskb = NULL; | |
dff29b1a | 1518 | struct tipc_link *pl = NULL; |
2da71425 | 1519 | int bearer_id = msg_bearer_id(msg); |
c1336ee4 | 1520 | int pos = 0; |
f006c9c7 | 1521 | |
dff29b1a | 1522 | if (msg_type(msg) != FAILOVER_MSG) { |
2da71425 JPM |
1523 | pr_warn("%sunknown tunnel pkt received\n", link_co_err); |
1524 | goto exit; | |
f006c9c7 | 1525 | } |
2da71425 JPM |
1526 | if (bearer_id >= MAX_BEARERS) |
1527 | goto exit; | |
dff29b1a JPM |
1528 | |
1529 | if (bearer_id == link->bearer_id) | |
2da71425 | 1530 | goto exit; |
b97bf3fd | 1531 | |
9d13ec65 | 1532 | pl = link->owner->links[bearer_id].link; |
dff29b1a JPM |
1533 | if (pl && tipc_link_is_up(pl)) |
1534 | tipc_link_reset(pl); | |
1535 | ||
1536 | if (link->failover_pkts == FIRST_FAILOVER) | |
1537 | link->failover_pkts = msg_msgcnt(msg); | |
1e9d47a9 | 1538 | |
2da71425 | 1539 | /* Should we expect an inner packet? */ |
dff29b1a | 1540 | if (!link->failover_pkts) |
cb4b102f | 1541 | goto exit; |
1dab3d5a | 1542 | |
2da71425 JPM |
1543 | if (!tipc_msg_extract(*skb, &iskb, &pos)) { |
1544 | pr_warn("%sno inner failover pkt\n", link_co_err); | |
1545 | *skb = NULL; | |
b97bf3fd | 1546 | goto exit; |
2da71425 | 1547 | } |
dff29b1a | 1548 | link->failover_pkts--; |
2da71425 | 1549 | *skb = NULL; |
b97bf3fd | 1550 | |
dff29b1a JPM |
1551 | /* Was this packet already delivered? */ |
1552 | if (less(buf_seqno(iskb), link->failover_checkpt)) { | |
2da71425 JPM |
1553 | kfree_skb(iskb); |
1554 | iskb = NULL; | |
1555 | goto exit; | |
1556 | } | |
1557 | if (msg_user(buf_msg(iskb)) == MSG_FRAGMENTER) { | |
1558 | link->stats.recv_fragments++; | |
dff29b1a | 1559 | tipc_buf_append(&link->failover_skb, &iskb); |
2da71425 | 1560 | } |
b97bf3fd | 1561 | exit: |
dff29b1a | 1562 | if (!link->failover_pkts && pl) |
d3504c34 | 1563 | pl->exec_mode = TIPC_LINK_OPEN; |
2da71425 JPM |
1564 | kfree_skb(*skb); |
1565 | *skb = iskb; | |
1566 | return *skb; | |
b97bf3fd PL |
1567 | } |
1568 | ||
d999297c JPM |
1569 | /* tipc_link_proto_rcv(): receive link level protocol message : |
1570 | * Note that network plane id propagates through the network, and may | |
1571 | * change at any time. The node with lowest numerical id determines | |
1572 | * network plane | |
1573 | */ | |
1574 | static int tipc_link_proto_rcv(struct tipc_link *l, struct sk_buff *skb, | |
1575 | struct sk_buff_head *xmitq) | |
1576 | { | |
1577 | struct tipc_msg *hdr = buf_msg(skb); | |
1578 | u16 rcvgap = 0; | |
1579 | u16 nacked_gap = msg_seq_gap(hdr); | |
1580 | u16 peers_snd_nxt = msg_next_sent(hdr); | |
1581 | u16 peers_tol = msg_link_tolerance(hdr); | |
1582 | u16 peers_prio = msg_linkprio(hdr); | |
1583 | char *if_name; | |
1584 | int rc = 0; | |
1585 | ||
1586 | if (l->exec_mode == TIPC_LINK_BLOCKED) | |
1587 | goto exit; | |
1588 | ||
1589 | if (link_own_addr(l) > msg_prevnode(hdr)) | |
1590 | l->net_plane = msg_net_plane(hdr); | |
1591 | ||
1592 | switch (msg_type(hdr)) { | |
1593 | case RESET_MSG: | |
1594 | ||
1595 | /* Ignore duplicate RESET with old session number */ | |
1596 | if ((less_eq(msg_session(hdr), l->peer_session)) && | |
1597 | (l->peer_session != WILDCARD_SESSION)) | |
1598 | break; | |
1599 | /* fall thru' */ | |
1600 | case ACTIVATE_MSG: | |
1601 | ||
1602 | /* Complete own link name with peer's interface name */ | |
1603 | if_name = strrchr(l->name, ':') + 1; | |
1604 | if (sizeof(l->name) - (if_name - l->name) <= TIPC_MAX_IF_NAME) | |
1605 | break; | |
1606 | if (msg_data_sz(hdr) < TIPC_MAX_IF_NAME) | |
1607 | break; | |
1608 | strncpy(if_name, msg_data(hdr), TIPC_MAX_IF_NAME); | |
1609 | ||
1610 | /* Update own tolerance if peer indicates a non-zero value */ | |
1611 | if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL)) | |
1612 | l->tolerance = peers_tol; | |
1613 | ||
1614 | /* Update own priority if peer's priority is higher */ | |
1615 | if (in_range(peers_prio, l->priority + 1, TIPC_MAX_LINK_PRI)) | |
1616 | l->priority = peers_prio; | |
1617 | ||
1618 | l->peer_session = msg_session(hdr); | |
1619 | l->peer_bearer_id = msg_bearer_id(hdr); | |
1620 | rc = tipc_link_fsm_evt(l, msg_type(hdr), xmitq); | |
1621 | if (l->mtu > msg_max_pkt(hdr)) | |
1622 | l->mtu = msg_max_pkt(hdr); | |
1623 | break; | |
1624 | case STATE_MSG: | |
1625 | /* Update own tolerance if peer indicates a non-zero value */ | |
1626 | if (in_range(peers_tol, TIPC_MIN_LINK_TOL, TIPC_MAX_LINK_TOL)) | |
1627 | l->tolerance = peers_tol; | |
1628 | ||
1629 | l->silent_intv_cnt = 0; | |
1630 | l->stats.recv_states++; | |
1631 | if (msg_probe(hdr)) | |
1632 | l->stats.recv_probes++; | |
1633 | rc = tipc_link_fsm_evt(l, TRAFFIC_EVT, xmitq); | |
1634 | if (!tipc_link_is_up(l)) | |
1635 | break; | |
1636 | ||
1637 | /* Has peer sent packets we haven't received yet ? */ | |
1638 | if (more(peers_snd_nxt, l->rcv_nxt)) | |
1639 | rcvgap = peers_snd_nxt - l->rcv_nxt; | |
1640 | if (rcvgap || (msg_probe(hdr))) | |
1641 | tipc_link_build_proto_msg(l, STATE_MSG, 0, rcvgap, | |
1642 | 0, l->mtu, xmitq); | |
1643 | tipc_link_release_pkts(l, msg_ack(hdr)); | |
1644 | ||
1645 | /* If NACK, retransmit will now start at right position */ | |
1646 | if (nacked_gap) { | |
1647 | rc |= tipc_link_retransm(l, nacked_gap, xmitq); | |
1648 | l->stats.recv_nacks++; | |
1649 | } | |
1650 | tipc_link_advance_backlog(l, xmitq); | |
1651 | if (unlikely(!skb_queue_empty(&l->wakeupq))) | |
1652 | link_prepare_wakeup(l); | |
1653 | } | |
1654 | exit: | |
1655 | kfree_skb(skb); | |
1656 | return rc; | |
1657 | } | |
1658 | ||
e3eea1eb | 1659 | void tipc_link_set_queue_limits(struct tipc_link *l, u32 win) |
b97bf3fd | 1660 | { |
ed193ece | 1661 | int max_bulk = TIPC_MAX_PUBLICATIONS / (l->mtu / ITEM_SIZE); |
e3eea1eb JPM |
1662 | |
1663 | l->window = win; | |
1f66d161 JPM |
1664 | l->backlog[TIPC_LOW_IMPORTANCE].limit = win / 2; |
1665 | l->backlog[TIPC_MEDIUM_IMPORTANCE].limit = win; | |
1666 | l->backlog[TIPC_HIGH_IMPORTANCE].limit = win / 2 * 3; | |
1667 | l->backlog[TIPC_CRITICAL_IMPORTANCE].limit = win * 2; | |
1668 | l->backlog[TIPC_SYSTEM_IMPORTANCE].limit = max_bulk; | |
b97bf3fd PL |
1669 | } |
1670 | ||
e099e86c | 1671 | /* tipc_link_find_owner - locate owner node of link by link's name |
f2f9800d | 1672 | * @net: the applicable net namespace |
e099e86c JPM |
1673 | * @name: pointer to link name string |
1674 | * @bearer_id: pointer to index in 'node->links' array where the link was found. | |
c4307285 | 1675 | * |
e099e86c | 1676 | * Returns pointer to node owning the link, or 0 if no matching link is found. |
b97bf3fd | 1677 | */ |
f2f9800d YX |
1678 | static struct tipc_node *tipc_link_find_owner(struct net *net, |
1679 | const char *link_name, | |
e099e86c | 1680 | unsigned int *bearer_id) |
b97bf3fd | 1681 | { |
f2f9800d | 1682 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
a18c4bc3 | 1683 | struct tipc_link *l_ptr; |
bbfbe47c | 1684 | struct tipc_node *n_ptr; |
886eaa1f | 1685 | struct tipc_node *found_node = NULL; |
bbfbe47c | 1686 | int i; |
b97bf3fd | 1687 | |
e099e86c | 1688 | *bearer_id = 0; |
6c7a762e | 1689 | rcu_read_lock(); |
f2f9800d | 1690 | list_for_each_entry_rcu(n_ptr, &tn->node_list, list) { |
a11607f5 | 1691 | tipc_node_lock(n_ptr); |
bbfbe47c | 1692 | for (i = 0; i < MAX_BEARERS; i++) { |
9d13ec65 | 1693 | l_ptr = n_ptr->links[i].link; |
e099e86c JPM |
1694 | if (l_ptr && !strcmp(l_ptr->name, link_name)) { |
1695 | *bearer_id = i; | |
1696 | found_node = n_ptr; | |
1697 | break; | |
1698 | } | |
bbfbe47c | 1699 | } |
a11607f5 | 1700 | tipc_node_unlock(n_ptr); |
e099e86c JPM |
1701 | if (found_node) |
1702 | break; | |
bbfbe47c | 1703 | } |
6c7a762e YX |
1704 | rcu_read_unlock(); |
1705 | ||
e099e86c | 1706 | return found_node; |
b97bf3fd PL |
1707 | } |
1708 | ||
b97bf3fd PL |
1709 | /** |
1710 | * link_reset_statistics - reset link statistics | |
1711 | * @l_ptr: pointer to link | |
1712 | */ | |
a18c4bc3 | 1713 | static void link_reset_statistics(struct tipc_link *l_ptr) |
b97bf3fd PL |
1714 | { |
1715 | memset(&l_ptr->stats, 0, sizeof(l_ptr->stats)); | |
a97b9d3f JPM |
1716 | l_ptr->stats.sent_info = l_ptr->snd_nxt; |
1717 | l_ptr->stats.recv_info = l_ptr->rcv_nxt; | |
b97bf3fd PL |
1718 | } |
1719 | ||
1a20cc25 | 1720 | static void link_print(struct tipc_link *l, const char *str) |
b97bf3fd | 1721 | { |
1a20cc25 JPM |
1722 | struct sk_buff *hskb = skb_peek(&l->transmq); |
1723 | u16 head = hskb ? msg_seqno(buf_msg(hskb)) : l->snd_nxt; | |
1724 | u16 tail = l->snd_nxt - 1; | |
7a2f7d18 | 1725 | |
1a20cc25 | 1726 | pr_info("%s Link <%s>:", str, l->name); |
8d64a5ba | 1727 | |
1a20cc25 | 1728 | if (link_probing(l)) |
6ab30f9c | 1729 | pr_cont(":P\n"); |
1a20cc25 | 1730 | else if (link_establishing(l)) |
6ab30f9c | 1731 | pr_cont(":E\n"); |
1a20cc25 | 1732 | else if (link_resetting(l)) |
6ab30f9c | 1733 | pr_cont(":R\n"); |
1a20cc25 | 1734 | else if (link_working(l)) |
6ab30f9c | 1735 | pr_cont(":W\n"); |
5deedde9 PG |
1736 | else |
1737 | pr_cont("\n"); | |
1a20cc25 JPM |
1738 | |
1739 | pr_info("XMTQ: %u [%u-%u], BKLGQ: %u, SNDNX: %u, RCVNX: %u\n", | |
1740 | skb_queue_len(&l->transmq), head, tail, | |
1741 | skb_queue_len(&l->backlogq), l->snd_nxt, l->rcv_nxt); | |
b97bf3fd | 1742 | } |
0655f6a8 RA |
1743 | |
1744 | /* Parse and validate nested (link) properties valid for media, bearer and link | |
1745 | */ | |
1746 | int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[]) | |
1747 | { | |
1748 | int err; | |
1749 | ||
1750 | err = nla_parse_nested(props, TIPC_NLA_PROP_MAX, prop, | |
1751 | tipc_nl_prop_policy); | |
1752 | if (err) | |
1753 | return err; | |
1754 | ||
1755 | if (props[TIPC_NLA_PROP_PRIO]) { | |
1756 | u32 prio; | |
1757 | ||
1758 | prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]); | |
1759 | if (prio > TIPC_MAX_LINK_PRI) | |
1760 | return -EINVAL; | |
1761 | } | |
1762 | ||
1763 | if (props[TIPC_NLA_PROP_TOL]) { | |
1764 | u32 tol; | |
1765 | ||
1766 | tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]); | |
1767 | if ((tol < TIPC_MIN_LINK_TOL) || (tol > TIPC_MAX_LINK_TOL)) | |
1768 | return -EINVAL; | |
1769 | } | |
1770 | ||
1771 | if (props[TIPC_NLA_PROP_WIN]) { | |
1772 | u32 win; | |
1773 | ||
1774 | win = nla_get_u32(props[TIPC_NLA_PROP_WIN]); | |
1775 | if ((win < TIPC_MIN_LINK_WIN) || (win > TIPC_MAX_LINK_WIN)) | |
1776 | return -EINVAL; | |
1777 | } | |
1778 | ||
1779 | return 0; | |
1780 | } | |
7be57fc6 | 1781 | |
f96ce7a2 RA |
1782 | int tipc_nl_link_set(struct sk_buff *skb, struct genl_info *info) |
1783 | { | |
1784 | int err; | |
1785 | int res = 0; | |
1786 | int bearer_id; | |
1787 | char *name; | |
1788 | struct tipc_link *link; | |
1789 | struct tipc_node *node; | |
1790 | struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1]; | |
37e2d484 | 1791 | struct net *net = sock_net(skb->sk); |
f96ce7a2 RA |
1792 | |
1793 | if (!info->attrs[TIPC_NLA_LINK]) | |
1794 | return -EINVAL; | |
1795 | ||
1796 | err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX, | |
1797 | info->attrs[TIPC_NLA_LINK], | |
1798 | tipc_nl_link_policy); | |
1799 | if (err) | |
1800 | return err; | |
1801 | ||
1802 | if (!attrs[TIPC_NLA_LINK_NAME]) | |
1803 | return -EINVAL; | |
1804 | ||
1805 | name = nla_data(attrs[TIPC_NLA_LINK_NAME]); | |
1806 | ||
670f4f88 RA |
1807 | if (strcmp(name, tipc_bclink_name) == 0) |
1808 | return tipc_nl_bc_link_set(net, attrs); | |
1809 | ||
f2f9800d | 1810 | node = tipc_link_find_owner(net, name, &bearer_id); |
f96ce7a2 RA |
1811 | if (!node) |
1812 | return -EINVAL; | |
1813 | ||
1814 | tipc_node_lock(node); | |
1815 | ||
9d13ec65 | 1816 | link = node->links[bearer_id].link; |
f96ce7a2 RA |
1817 | if (!link) { |
1818 | res = -EINVAL; | |
1819 | goto out; | |
1820 | } | |
1821 | ||
1822 | if (attrs[TIPC_NLA_LINK_PROP]) { | |
1823 | struct nlattr *props[TIPC_NLA_PROP_MAX + 1]; | |
1824 | ||
1825 | err = tipc_nl_parse_link_prop(attrs[TIPC_NLA_LINK_PROP], | |
1826 | props); | |
1827 | if (err) { | |
1828 | res = err; | |
1829 | goto out; | |
1830 | } | |
1831 | ||
1832 | if (props[TIPC_NLA_PROP_TOL]) { | |
1833 | u32 tol; | |
1834 | ||
1835 | tol = nla_get_u32(props[TIPC_NLA_PROP_TOL]); | |
8a1577c9 | 1836 | link->tolerance = tol; |
ed193ece | 1837 | tipc_link_proto_xmit(link, STATE_MSG, 0, 0, tol, 0); |
f96ce7a2 RA |
1838 | } |
1839 | if (props[TIPC_NLA_PROP_PRIO]) { | |
1840 | u32 prio; | |
1841 | ||
1842 | prio = nla_get_u32(props[TIPC_NLA_PROP_PRIO]); | |
1843 | link->priority = prio; | |
ed193ece | 1844 | tipc_link_proto_xmit(link, STATE_MSG, 0, 0, 0, prio); |
f96ce7a2 RA |
1845 | } |
1846 | if (props[TIPC_NLA_PROP_WIN]) { | |
1847 | u32 win; | |
1848 | ||
1849 | win = nla_get_u32(props[TIPC_NLA_PROP_WIN]); | |
1850 | tipc_link_set_queue_limits(link, win); | |
1851 | } | |
1852 | } | |
1853 | ||
1854 | out: | |
1855 | tipc_node_unlock(node); | |
1856 | ||
1857 | return res; | |
1858 | } | |
d8182804 RA |
1859 | |
1860 | static int __tipc_nl_add_stats(struct sk_buff *skb, struct tipc_stats *s) | |
7be57fc6 RA |
1861 | { |
1862 | int i; | |
1863 | struct nlattr *stats; | |
1864 | ||
1865 | struct nla_map { | |
1866 | u32 key; | |
1867 | u32 val; | |
1868 | }; | |
1869 | ||
1870 | struct nla_map map[] = { | |
1871 | {TIPC_NLA_STATS_RX_INFO, s->recv_info}, | |
1872 | {TIPC_NLA_STATS_RX_FRAGMENTS, s->recv_fragments}, | |
1873 | {TIPC_NLA_STATS_RX_FRAGMENTED, s->recv_fragmented}, | |
1874 | {TIPC_NLA_STATS_RX_BUNDLES, s->recv_bundles}, | |
1875 | {TIPC_NLA_STATS_RX_BUNDLED, s->recv_bundled}, | |
1876 | {TIPC_NLA_STATS_TX_INFO, s->sent_info}, | |
1877 | {TIPC_NLA_STATS_TX_FRAGMENTS, s->sent_fragments}, | |
1878 | {TIPC_NLA_STATS_TX_FRAGMENTED, s->sent_fragmented}, | |
1879 | {TIPC_NLA_STATS_TX_BUNDLES, s->sent_bundles}, | |
1880 | {TIPC_NLA_STATS_TX_BUNDLED, s->sent_bundled}, | |
1881 | {TIPC_NLA_STATS_MSG_PROF_TOT, (s->msg_length_counts) ? | |
1882 | s->msg_length_counts : 1}, | |
1883 | {TIPC_NLA_STATS_MSG_LEN_CNT, s->msg_length_counts}, | |
1884 | {TIPC_NLA_STATS_MSG_LEN_TOT, s->msg_lengths_total}, | |
1885 | {TIPC_NLA_STATS_MSG_LEN_P0, s->msg_length_profile[0]}, | |
1886 | {TIPC_NLA_STATS_MSG_LEN_P1, s->msg_length_profile[1]}, | |
1887 | {TIPC_NLA_STATS_MSG_LEN_P2, s->msg_length_profile[2]}, | |
1888 | {TIPC_NLA_STATS_MSG_LEN_P3, s->msg_length_profile[3]}, | |
1889 | {TIPC_NLA_STATS_MSG_LEN_P4, s->msg_length_profile[4]}, | |
1890 | {TIPC_NLA_STATS_MSG_LEN_P5, s->msg_length_profile[5]}, | |
1891 | {TIPC_NLA_STATS_MSG_LEN_P6, s->msg_length_profile[6]}, | |
1892 | {TIPC_NLA_STATS_RX_STATES, s->recv_states}, | |
1893 | {TIPC_NLA_STATS_RX_PROBES, s->recv_probes}, | |
1894 | {TIPC_NLA_STATS_RX_NACKS, s->recv_nacks}, | |
1895 | {TIPC_NLA_STATS_RX_DEFERRED, s->deferred_recv}, | |
1896 | {TIPC_NLA_STATS_TX_STATES, s->sent_states}, | |
1897 | {TIPC_NLA_STATS_TX_PROBES, s->sent_probes}, | |
1898 | {TIPC_NLA_STATS_TX_NACKS, s->sent_nacks}, | |
1899 | {TIPC_NLA_STATS_TX_ACKS, s->sent_acks}, | |
1900 | {TIPC_NLA_STATS_RETRANSMITTED, s->retransmitted}, | |
1901 | {TIPC_NLA_STATS_DUPLICATES, s->duplicates}, | |
1902 | {TIPC_NLA_STATS_LINK_CONGS, s->link_congs}, | |
1903 | {TIPC_NLA_STATS_MAX_QUEUE, s->max_queue_sz}, | |
1904 | {TIPC_NLA_STATS_AVG_QUEUE, s->queue_sz_counts ? | |
1905 | (s->accu_queue_sz / s->queue_sz_counts) : 0} | |
1906 | }; | |
1907 | ||
1908 | stats = nla_nest_start(skb, TIPC_NLA_LINK_STATS); | |
1909 | if (!stats) | |
1910 | return -EMSGSIZE; | |
1911 | ||
1912 | for (i = 0; i < ARRAY_SIZE(map); i++) | |
1913 | if (nla_put_u32(skb, map[i].key, map[i].val)) | |
1914 | goto msg_full; | |
1915 | ||
1916 | nla_nest_end(skb, stats); | |
1917 | ||
1918 | return 0; | |
1919 | msg_full: | |
1920 | nla_nest_cancel(skb, stats); | |
1921 | ||
1922 | return -EMSGSIZE; | |
1923 | } | |
1924 | ||
1925 | /* Caller should hold appropriate locks to protect the link */ | |
34747539 | 1926 | static int __tipc_nl_add_link(struct net *net, struct tipc_nl_msg *msg, |
f2f67390 | 1927 | struct tipc_link *link, int nlflags) |
7be57fc6 RA |
1928 | { |
1929 | int err; | |
1930 | void *hdr; | |
1931 | struct nlattr *attrs; | |
1932 | struct nlattr *prop; | |
34747539 | 1933 | struct tipc_net *tn = net_generic(net, tipc_net_id); |
7be57fc6 | 1934 | |
bfb3e5dd | 1935 | hdr = genlmsg_put(msg->skb, msg->portid, msg->seq, &tipc_genl_family, |
f2f67390 | 1936 | nlflags, TIPC_NL_LINK_GET); |
7be57fc6 RA |
1937 | if (!hdr) |
1938 | return -EMSGSIZE; | |
1939 | ||
1940 | attrs = nla_nest_start(msg->skb, TIPC_NLA_LINK); | |
1941 | if (!attrs) | |
1942 | goto msg_full; | |
1943 | ||
1944 | if (nla_put_string(msg->skb, TIPC_NLA_LINK_NAME, link->name)) | |
1945 | goto attr_msg_full; | |
1946 | if (nla_put_u32(msg->skb, TIPC_NLA_LINK_DEST, | |
34747539 | 1947 | tipc_cluster_mask(tn->own_addr))) |
7be57fc6 | 1948 | goto attr_msg_full; |
ed193ece | 1949 | if (nla_put_u32(msg->skb, TIPC_NLA_LINK_MTU, link->mtu)) |
7be57fc6 | 1950 | goto attr_msg_full; |
a97b9d3f | 1951 | if (nla_put_u32(msg->skb, TIPC_NLA_LINK_RX, link->rcv_nxt)) |
7be57fc6 | 1952 | goto attr_msg_full; |
a97b9d3f | 1953 | if (nla_put_u32(msg->skb, TIPC_NLA_LINK_TX, link->snd_nxt)) |
7be57fc6 RA |
1954 | goto attr_msg_full; |
1955 | ||
1956 | if (tipc_link_is_up(link)) | |
1957 | if (nla_put_flag(msg->skb, TIPC_NLA_LINK_UP)) | |
1958 | goto attr_msg_full; | |
1959 | if (tipc_link_is_active(link)) | |
1960 | if (nla_put_flag(msg->skb, TIPC_NLA_LINK_ACTIVE)) | |
1961 | goto attr_msg_full; | |
1962 | ||
1963 | prop = nla_nest_start(msg->skb, TIPC_NLA_LINK_PROP); | |
1964 | if (!prop) | |
1965 | goto attr_msg_full; | |
1966 | if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority)) | |
1967 | goto prop_msg_full; | |
1968 | if (nla_put_u32(msg->skb, TIPC_NLA_PROP_TOL, link->tolerance)) | |
1969 | goto prop_msg_full; | |
1970 | if (nla_put_u32(msg->skb, TIPC_NLA_PROP_WIN, | |
1f66d161 | 1971 | link->window)) |
7be57fc6 RA |
1972 | goto prop_msg_full; |
1973 | if (nla_put_u32(msg->skb, TIPC_NLA_PROP_PRIO, link->priority)) | |
1974 | goto prop_msg_full; | |
1975 | nla_nest_end(msg->skb, prop); | |
1976 | ||
1977 | err = __tipc_nl_add_stats(msg->skb, &link->stats); | |
1978 | if (err) | |
1979 | goto attr_msg_full; | |
1980 | ||
1981 | nla_nest_end(msg->skb, attrs); | |
1982 | genlmsg_end(msg->skb, hdr); | |
1983 | ||
1984 | return 0; | |
1985 | ||
1986 | prop_msg_full: | |
1987 | nla_nest_cancel(msg->skb, prop); | |
1988 | attr_msg_full: | |
1989 | nla_nest_cancel(msg->skb, attrs); | |
1990 | msg_full: | |
1991 | genlmsg_cancel(msg->skb, hdr); | |
1992 | ||
1993 | return -EMSGSIZE; | |
1994 | } | |
1995 | ||
1996 | /* Caller should hold node lock */ | |
34747539 YX |
1997 | static int __tipc_nl_add_node_links(struct net *net, struct tipc_nl_msg *msg, |
1998 | struct tipc_node *node, u32 *prev_link) | |
7be57fc6 RA |
1999 | { |
2000 | u32 i; | |
2001 | int err; | |
2002 | ||
2003 | for (i = *prev_link; i < MAX_BEARERS; i++) { | |
2004 | *prev_link = i; | |
2005 | ||
9d13ec65 | 2006 | if (!node->links[i].link) |
7be57fc6 RA |
2007 | continue; |
2008 | ||
9d13ec65 JPM |
2009 | err = __tipc_nl_add_link(net, msg, |
2010 | node->links[i].link, NLM_F_MULTI); | |
7be57fc6 RA |
2011 | if (err) |
2012 | return err; | |
2013 | } | |
2014 | *prev_link = 0; | |
2015 | ||
2016 | return 0; | |
2017 | } | |
2018 | ||
2019 | int tipc_nl_link_dump(struct sk_buff *skb, struct netlink_callback *cb) | |
2020 | { | |
f2f9800d YX |
2021 | struct net *net = sock_net(skb->sk); |
2022 | struct tipc_net *tn = net_generic(net, tipc_net_id); | |
7be57fc6 RA |
2023 | struct tipc_node *node; |
2024 | struct tipc_nl_msg msg; | |
2025 | u32 prev_node = cb->args[0]; | |
2026 | u32 prev_link = cb->args[1]; | |
2027 | int done = cb->args[2]; | |
2028 | int err; | |
2029 | ||
2030 | if (done) | |
2031 | return 0; | |
2032 | ||
2033 | msg.skb = skb; | |
2034 | msg.portid = NETLINK_CB(cb->skb).portid; | |
2035 | msg.seq = cb->nlh->nlmsg_seq; | |
2036 | ||
2037 | rcu_read_lock(); | |
7be57fc6 | 2038 | if (prev_node) { |
f2f9800d | 2039 | node = tipc_node_find(net, prev_node); |
7be57fc6 RA |
2040 | if (!node) { |
2041 | /* We never set seq or call nl_dump_check_consistent() | |
2042 | * this means that setting prev_seq here will cause the | |
2043 | * consistence check to fail in the netlink callback | |
2044 | * handler. Resulting in the last NLMSG_DONE message | |
2045 | * having the NLM_F_DUMP_INTR flag set. | |
2046 | */ | |
2047 | cb->prev_seq = 1; | |
2048 | goto out; | |
2049 | } | |
8a0f6ebe | 2050 | tipc_node_put(node); |
7be57fc6 | 2051 | |
f2f9800d YX |
2052 | list_for_each_entry_continue_rcu(node, &tn->node_list, |
2053 | list) { | |
7be57fc6 | 2054 | tipc_node_lock(node); |
34747539 YX |
2055 | err = __tipc_nl_add_node_links(net, &msg, node, |
2056 | &prev_link); | |
7be57fc6 RA |
2057 | tipc_node_unlock(node); |
2058 | if (err) | |
2059 | goto out; | |
2060 | ||
2061 | prev_node = node->addr; | |
2062 | } | |
2063 | } else { | |
1da46568 | 2064 | err = tipc_nl_add_bc_link(net, &msg); |
7be57fc6 RA |
2065 | if (err) |
2066 | goto out; | |
2067 | ||
f2f9800d | 2068 | list_for_each_entry_rcu(node, &tn->node_list, list) { |
7be57fc6 | 2069 | tipc_node_lock(node); |
34747539 YX |
2070 | err = __tipc_nl_add_node_links(net, &msg, node, |
2071 | &prev_link); | |
7be57fc6 RA |
2072 | tipc_node_unlock(node); |
2073 | if (err) | |
2074 | goto out; | |
2075 | ||
2076 | prev_node = node->addr; | |
2077 | } | |
2078 | } | |
2079 | done = 1; | |
2080 | out: | |
2081 | rcu_read_unlock(); | |
2082 | ||
2083 | cb->args[0] = prev_node; | |
2084 | cb->args[1] = prev_link; | |
2085 | cb->args[2] = done; | |
2086 | ||
2087 | return skb->len; | |
2088 | } | |
2089 | ||
2090 | int tipc_nl_link_get(struct sk_buff *skb, struct genl_info *info) | |
2091 | { | |
f2f9800d | 2092 | struct net *net = genl_info_net(info); |
7be57fc6 | 2093 | struct tipc_nl_msg msg; |
7be57fc6 | 2094 | char *name; |
7be57fc6 RA |
2095 | int err; |
2096 | ||
670f4f88 RA |
2097 | msg.portid = info->snd_portid; |
2098 | msg.seq = info->snd_seq; | |
2099 | ||
7be57fc6 RA |
2100 | if (!info->attrs[TIPC_NLA_LINK_NAME]) |
2101 | return -EINVAL; | |
7be57fc6 | 2102 | name = nla_data(info->attrs[TIPC_NLA_LINK_NAME]); |
7be57fc6 | 2103 | |
670f4f88 RA |
2104 | msg.skb = nlmsg_new(NLMSG_GOODSIZE, GFP_KERNEL); |
2105 | if (!msg.skb) | |
7be57fc6 RA |
2106 | return -ENOMEM; |
2107 | ||
670f4f88 RA |
2108 | if (strcmp(name, tipc_bclink_name) == 0) { |
2109 | err = tipc_nl_add_bc_link(net, &msg); | |
2110 | if (err) { | |
2111 | nlmsg_free(msg.skb); | |
2112 | return err; | |
2113 | } | |
2114 | } else { | |
2115 | int bearer_id; | |
2116 | struct tipc_node *node; | |
2117 | struct tipc_link *link; | |
7be57fc6 | 2118 | |
670f4f88 RA |
2119 | node = tipc_link_find_owner(net, name, &bearer_id); |
2120 | if (!node) | |
2121 | return -EINVAL; | |
7be57fc6 | 2122 | |
670f4f88 | 2123 | tipc_node_lock(node); |
9d13ec65 | 2124 | link = node->links[bearer_id].link; |
670f4f88 RA |
2125 | if (!link) { |
2126 | tipc_node_unlock(node); | |
2127 | nlmsg_free(msg.skb); | |
2128 | return -EINVAL; | |
2129 | } | |
7be57fc6 | 2130 | |
670f4f88 RA |
2131 | err = __tipc_nl_add_link(net, &msg, link, 0); |
2132 | tipc_node_unlock(node); | |
2133 | if (err) { | |
2134 | nlmsg_free(msg.skb); | |
2135 | return err; | |
2136 | } | |
2137 | } | |
7be57fc6 | 2138 | |
670f4f88 | 2139 | return genlmsg_reply(msg.skb, info); |
7be57fc6 | 2140 | } |
ae36342b RA |
2141 | |
2142 | int tipc_nl_link_reset_stats(struct sk_buff *skb, struct genl_info *info) | |
2143 | { | |
2144 | int err; | |
2145 | char *link_name; | |
2146 | unsigned int bearer_id; | |
2147 | struct tipc_link *link; | |
2148 | struct tipc_node *node; | |
2149 | struct nlattr *attrs[TIPC_NLA_LINK_MAX + 1]; | |
1817877b | 2150 | struct net *net = sock_net(skb->sk); |
ae36342b RA |
2151 | |
2152 | if (!info->attrs[TIPC_NLA_LINK]) | |
2153 | return -EINVAL; | |
2154 | ||
2155 | err = nla_parse_nested(attrs, TIPC_NLA_LINK_MAX, | |
2156 | info->attrs[TIPC_NLA_LINK], | |
2157 | tipc_nl_link_policy); | |
2158 | if (err) | |
2159 | return err; | |
2160 | ||
2161 | if (!attrs[TIPC_NLA_LINK_NAME]) | |
2162 | return -EINVAL; | |
2163 | ||
2164 | link_name = nla_data(attrs[TIPC_NLA_LINK_NAME]); | |
2165 | ||
2166 | if (strcmp(link_name, tipc_bclink_name) == 0) { | |
1da46568 | 2167 | err = tipc_bclink_reset_stats(net); |
ae36342b RA |
2168 | if (err) |
2169 | return err; | |
2170 | return 0; | |
2171 | } | |
2172 | ||
f2f9800d | 2173 | node = tipc_link_find_owner(net, link_name, &bearer_id); |
ae36342b RA |
2174 | if (!node) |
2175 | return -EINVAL; | |
2176 | ||
2177 | tipc_node_lock(node); | |
2178 | ||
9d13ec65 | 2179 | link = node->links[bearer_id].link; |
ae36342b RA |
2180 | if (!link) { |
2181 | tipc_node_unlock(node); | |
2182 | return -EINVAL; | |
2183 | } | |
2184 | ||
2185 | link_reset_statistics(link); | |
2186 | ||
2187 | tipc_node_unlock(node); | |
2188 | ||
2189 | return 0; | |
2190 | } |