2 * net/tipc/link.c: TIPC link code
4 * Copyright (c) 1996-2007, Ericsson AB
5 * Copyright (c) 2004-2007, Wind River Systems
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
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.
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.
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
34 * POSSIBILITY OF SUCH DAMAGE.
44 #include "node_subscr.h"
45 #include "name_distr.h"
47 #include "name_table.h"
54 * Limit for deferred reception queue:
57 #define DEF_QUEUE_LIMIT 256u
63 #define STARTING_EVT 856384768 /* link processing trigger */
64 #define TRAFFIC_MSG_EVT 560815u /* rx'd ??? */
65 #define TIMEOUT_EVT 560817u /* link timer expired */
68 * The following two 'message types' is really just implementation
69 * data conveniently stored in the message header.
70 * They must not be considered part of the protocol
76 * State value stored in 'exp_msg_count'
79 #define START_CHANGEOVER 100000u
82 * struct link_name - deconstructed link name
83 * @addr_local: network address of node at this end
84 * @if_local: name of interface at this end
85 * @addr_peer: network address of node at far end
86 * @if_peer: name of interface at far end
91 char if_local
[TIPC_MAX_IF_NAME
];
93 char if_peer
[TIPC_MAX_IF_NAME
];
98 /* LINK EVENT CODE IS NOT SUPPORTED AT PRESENT */
101 * struct link_event - link up/down event notification
107 void (*fcn
)(u32
, char *, int);
108 char name
[TIPC_MAX_LINK_NAME
];
113 static void link_handle_out_of_seq_msg(struct link
*l_ptr
,
114 struct sk_buff
*buf
);
115 static void link_recv_proto_msg(struct link
*l_ptr
, struct sk_buff
*buf
);
116 static int link_recv_changeover_msg(struct link
**l_ptr
, struct sk_buff
**buf
);
117 static void link_set_supervision_props(struct link
*l_ptr
, u32 tolerance
);
118 static int link_send_sections_long(struct port
*sender
,
119 struct iovec
const *msg_sect
,
120 u32 num_sect
, u32 destnode
);
121 static void link_check_defragm_bufs(struct link
*l_ptr
);
122 static void link_state_event(struct link
*l_ptr
, u32 event
);
123 static void link_reset_statistics(struct link
*l_ptr
);
124 static void link_print(struct link
*l_ptr
, struct print_buf
*buf
,
128 * Debugging code used by link routines only
130 * When debugging link problems on a system that has multiple links,
131 * the standard TIPC debugging routines may not be useful since they
132 * allow the output from multiple links to be intermixed. For this reason
133 * routines of the form "dbg_link_XXX()" have been created that will capture
134 * debug info into a link's personal print buffer, which can then be dumped
135 * into the TIPC system log (TIPC_LOG) upon request.
137 * To enable per-link debugging, use LINK_LOG_BUF_SIZE to specify the size
138 * of the print buffer used by each link. If LINK_LOG_BUF_SIZE is set to 0,
139 * the dbg_link_XXX() routines simply send their output to the standard
140 * debug print buffer (DBG_OUTPUT), if it has been defined; this can be useful
141 * when there is only a single link in the system being debugged.
144 * - When enabled, LINK_LOG_BUF_SIZE should be set to at least TIPC_PB_MIN_SIZE
145 * - "l_ptr" must be valid when using dbg_link_XXX() macros
148 #define LINK_LOG_BUF_SIZE 0
150 #define dbg_link(fmt, arg...) \
152 if (LINK_LOG_BUF_SIZE) \
153 tipc_printf(&l_ptr->print_buf, fmt, ## arg); \
155 #define dbg_link_msg(msg, txt) \
157 if (LINK_LOG_BUF_SIZE) \
158 tipc_msg_dbg(&l_ptr->print_buf, msg, txt); \
160 #define dbg_link_state(txt) \
162 if (LINK_LOG_BUF_SIZE) \
163 link_print(l_ptr, &l_ptr->print_buf, txt); \
165 #define dbg_link_dump() do { \
166 if (LINK_LOG_BUF_SIZE) { \
167 tipc_printf(LOG, "\n\nDumping link <%s>:\n", l_ptr->name); \
168 tipc_printbuf_move(LOG, &l_ptr->print_buf); \
172 static void dbg_print_link(struct link
*l_ptr
, const char *str
)
174 if (DBG_OUTPUT
!= TIPC_NULL
)
175 link_print(l_ptr
, DBG_OUTPUT
, str
);
178 static void dbg_print_buf_chain(struct sk_buff
*root_buf
)
180 if (DBG_OUTPUT
!= TIPC_NULL
) {
181 struct sk_buff
*buf
= root_buf
;
184 msg_dbg(buf_msg(buf
), "In chain: ");
191 * Simple link routines
194 static unsigned int align(unsigned int i
)
196 return (i
+ 3) & ~3u;
199 static int link_working_working(struct link
*l_ptr
)
201 return (l_ptr
->state
== WORKING_WORKING
);
204 static int link_working_unknown(struct link
*l_ptr
)
206 return (l_ptr
->state
== WORKING_UNKNOWN
);
209 static int link_reset_unknown(struct link
*l_ptr
)
211 return (l_ptr
->state
== RESET_UNKNOWN
);
214 static int link_reset_reset(struct link
*l_ptr
)
216 return (l_ptr
->state
== RESET_RESET
);
219 static int link_blocked(struct link
*l_ptr
)
221 return (l_ptr
->exp_msg_count
|| l_ptr
->blocked
);
224 static int link_congested(struct link
*l_ptr
)
226 return (l_ptr
->out_queue_size
>= l_ptr
->queue_limit
[0]);
229 static u32
link_max_pkt(struct link
*l_ptr
)
231 return l_ptr
->max_pkt
;
234 static void link_init_max_pkt(struct link
*l_ptr
)
238 max_pkt
= (l_ptr
->b_ptr
->publ
.mtu
& ~3);
239 if (max_pkt
> MAX_MSG_SIZE
)
240 max_pkt
= MAX_MSG_SIZE
;
242 l_ptr
->max_pkt_target
= max_pkt
;
243 if (l_ptr
->max_pkt_target
< MAX_PKT_DEFAULT
)
244 l_ptr
->max_pkt
= l_ptr
->max_pkt_target
;
246 l_ptr
->max_pkt
= MAX_PKT_DEFAULT
;
248 l_ptr
->max_pkt_probes
= 0;
251 static u32
link_next_sent(struct link
*l_ptr
)
254 return msg_seqno(buf_msg(l_ptr
->next_out
));
255 return mod(l_ptr
->next_out_no
);
258 static u32
link_last_sent(struct link
*l_ptr
)
260 return mod(link_next_sent(l_ptr
) - 1);
264 * Simple non-static link routines (i.e. referenced outside this file)
267 int tipc_link_is_up(struct link
*l_ptr
)
271 return (link_working_working(l_ptr
) || link_working_unknown(l_ptr
));
274 int tipc_link_is_active(struct link
*l_ptr
)
276 return ((l_ptr
->owner
->active_links
[0] == l_ptr
) ||
277 (l_ptr
->owner
->active_links
[1] == l_ptr
));
281 * link_name_validate - validate & (optionally) deconstruct link name
282 * @name - ptr to link name string
283 * @name_parts - ptr to area for link name components (or NULL if not needed)
285 * Returns 1 if link name is valid, otherwise 0.
288 static int link_name_validate(const char *name
, struct link_name
*name_parts
)
290 char name_copy
[TIPC_MAX_LINK_NAME
];
296 u32 z_local
, c_local
, n_local
;
297 u32 z_peer
, c_peer
, n_peer
;
301 /* copy link name & ensure length is OK */
303 name_copy
[TIPC_MAX_LINK_NAME
- 1] = 0;
304 /* need above in case non-Posix strncpy() doesn't pad with nulls */
305 strncpy(name_copy
, name
, TIPC_MAX_LINK_NAME
);
306 if (name_copy
[TIPC_MAX_LINK_NAME
- 1] != 0)
309 /* ensure all component parts of link name are present */
311 addr_local
= name_copy
;
312 if ((if_local
= strchr(addr_local
, ':')) == NULL
)
315 if ((addr_peer
= strchr(if_local
, '-')) == NULL
)
318 if_local_len
= addr_peer
- if_local
;
319 if ((if_peer
= strchr(addr_peer
, ':')) == NULL
)
322 if_peer_len
= strlen(if_peer
) + 1;
324 /* validate component parts of link name */
326 if ((sscanf(addr_local
, "%u.%u.%u%c",
327 &z_local
, &c_local
, &n_local
, &dummy
) != 3) ||
328 (sscanf(addr_peer
, "%u.%u.%u%c",
329 &z_peer
, &c_peer
, &n_peer
, &dummy
) != 3) ||
330 (z_local
> 255) || (c_local
> 4095) || (n_local
> 4095) ||
331 (z_peer
> 255) || (c_peer
> 4095) || (n_peer
> 4095) ||
332 (if_local_len
<= 1) || (if_local_len
> TIPC_MAX_IF_NAME
) ||
333 (if_peer_len
<= 1) || (if_peer_len
> TIPC_MAX_IF_NAME
) ||
334 (strspn(if_local
, tipc_alphabet
) != (if_local_len
- 1)) ||
335 (strspn(if_peer
, tipc_alphabet
) != (if_peer_len
- 1)))
338 /* return link name components, if necessary */
341 name_parts
->addr_local
= tipc_addr(z_local
, c_local
, n_local
);
342 strcpy(name_parts
->if_local
, if_local
);
343 name_parts
->addr_peer
= tipc_addr(z_peer
, c_peer
, n_peer
);
344 strcpy(name_parts
->if_peer
, if_peer
);
350 * link_timeout - handle expiration of link timer
351 * @l_ptr: pointer to link
353 * This routine must not grab "tipc_net_lock" to avoid a potential deadlock conflict
354 * with tipc_link_delete(). (There is no risk that the node will be deleted by
355 * another thread because tipc_link_delete() always cancels the link timer before
356 * tipc_node_delete() is called.)
359 static void link_timeout(struct link
*l_ptr
)
361 tipc_node_lock(l_ptr
->owner
);
363 /* update counters used in statistical profiling of send traffic */
365 l_ptr
->stats
.accu_queue_sz
+= l_ptr
->out_queue_size
;
366 l_ptr
->stats
.queue_sz_counts
++;
368 if (l_ptr
->out_queue_size
> l_ptr
->stats
.max_queue_sz
)
369 l_ptr
->stats
.max_queue_sz
= l_ptr
->out_queue_size
;
371 if (l_ptr
->first_out
) {
372 struct tipc_msg
*msg
= buf_msg(l_ptr
->first_out
);
373 u32 length
= msg_size(msg
);
375 if ((msg_user(msg
) == MSG_FRAGMENTER
)
376 && (msg_type(msg
) == FIRST_FRAGMENT
)) {
377 length
= msg_size(msg_get_wrapped(msg
));
380 l_ptr
->stats
.msg_lengths_total
+= length
;
381 l_ptr
->stats
.msg_length_counts
++;
383 l_ptr
->stats
.msg_length_profile
[0]++;
384 else if (length
<= 256)
385 l_ptr
->stats
.msg_length_profile
[1]++;
386 else if (length
<= 1024)
387 l_ptr
->stats
.msg_length_profile
[2]++;
388 else if (length
<= 4096)
389 l_ptr
->stats
.msg_length_profile
[3]++;
390 else if (length
<= 16384)
391 l_ptr
->stats
.msg_length_profile
[4]++;
392 else if (length
<= 32768)
393 l_ptr
->stats
.msg_length_profile
[5]++;
395 l_ptr
->stats
.msg_length_profile
[6]++;
399 /* do all other link processing performed on a periodic basis */
401 link_check_defragm_bufs(l_ptr
);
403 link_state_event(l_ptr
, TIMEOUT_EVT
);
406 tipc_link_push_queue(l_ptr
);
408 tipc_node_unlock(l_ptr
->owner
);
411 static void link_set_timer(struct link
*l_ptr
, u32 time
)
413 k_start_timer(&l_ptr
->timer
, time
);
417 * tipc_link_create - create a new link
418 * @b_ptr: pointer to associated bearer
419 * @peer: network address of node at other end of link
420 * @media_addr: media address to use when sending messages over link
422 * Returns pointer to link.
425 struct link
*tipc_link_create(struct bearer
*b_ptr
, const u32 peer
,
426 const struct tipc_media_addr
*media_addr
)
429 struct tipc_msg
*msg
;
432 l_ptr
= kzalloc(sizeof(*l_ptr
), GFP_ATOMIC
);
434 warn("Link creation failed, no memory\n");
438 if (LINK_LOG_BUF_SIZE
) {
439 char *pb
= kmalloc(LINK_LOG_BUF_SIZE
, GFP_ATOMIC
);
443 warn("Link creation failed, no memory for print buffer\n");
446 tipc_printbuf_init(&l_ptr
->print_buf
, pb
, LINK_LOG_BUF_SIZE
);
450 if_name
= strchr(b_ptr
->publ
.name
, ':') + 1;
451 sprintf(l_ptr
->name
, "%u.%u.%u:%s-%u.%u.%u:",
452 tipc_zone(tipc_own_addr
), tipc_cluster(tipc_own_addr
),
453 tipc_node(tipc_own_addr
),
455 tipc_zone(peer
), tipc_cluster(peer
), tipc_node(peer
));
456 /* note: peer i/f is appended to link name by reset/activate */
457 memcpy(&l_ptr
->media_addr
, media_addr
, sizeof(*media_addr
));
458 l_ptr
->checkpoint
= 1;
459 l_ptr
->b_ptr
= b_ptr
;
460 link_set_supervision_props(l_ptr
, b_ptr
->media
->tolerance
);
461 l_ptr
->state
= RESET_UNKNOWN
;
463 l_ptr
->pmsg
= (struct tipc_msg
*)&l_ptr
->proto_msg
;
465 msg_init(msg
, LINK_PROTOCOL
, RESET_MSG
, TIPC_OK
, INT_H_SIZE
, l_ptr
->addr
);
466 msg_set_size(msg
, sizeof(l_ptr
->proto_msg
));
467 msg_set_session(msg
, tipc_random
);
468 msg_set_bearer_id(msg
, b_ptr
->identity
);
469 strcpy((char *)msg_data(msg
), if_name
);
471 l_ptr
->priority
= b_ptr
->priority
;
472 tipc_link_set_queue_limits(l_ptr
, b_ptr
->media
->window
);
474 link_init_max_pkt(l_ptr
);
476 l_ptr
->next_out_no
= 1;
477 INIT_LIST_HEAD(&l_ptr
->waiting_ports
);
479 link_reset_statistics(l_ptr
);
481 l_ptr
->owner
= tipc_node_attach_link(l_ptr
);
483 if (LINK_LOG_BUF_SIZE
)
484 kfree(l_ptr
->print_buf
.buf
);
489 k_init_timer(&l_ptr
->timer
, (Handler
)link_timeout
, (unsigned long)l_ptr
);
490 list_add_tail(&l_ptr
->link_list
, &b_ptr
->links
);
491 tipc_k_signal((Handler
)tipc_link_start
, (unsigned long)l_ptr
);
493 dbg("tipc_link_create(): tolerance = %u,cont intv = %u, abort_limit = %u\n",
494 l_ptr
->tolerance
, l_ptr
->continuity_interval
, l_ptr
->abort_limit
);
500 * tipc_link_delete - delete a link
501 * @l_ptr: pointer to link
503 * Note: 'tipc_net_lock' is write_locked, bearer is locked.
504 * This routine must not grab the node lock until after link timer cancellation
505 * to avoid a potential deadlock situation.
508 void tipc_link_delete(struct link
*l_ptr
)
511 err("Attempt to delete non-existent link\n");
515 dbg("tipc_link_delete()\n");
517 k_cancel_timer(&l_ptr
->timer
);
519 tipc_node_lock(l_ptr
->owner
);
520 tipc_link_reset(l_ptr
);
521 tipc_node_detach_link(l_ptr
->owner
, l_ptr
);
522 tipc_link_stop(l_ptr
);
523 list_del_init(&l_ptr
->link_list
);
524 if (LINK_LOG_BUF_SIZE
)
525 kfree(l_ptr
->print_buf
.buf
);
526 tipc_node_unlock(l_ptr
->owner
);
527 k_term_timer(&l_ptr
->timer
);
531 void tipc_link_start(struct link
*l_ptr
)
533 dbg("tipc_link_start %x\n", l_ptr
);
534 link_state_event(l_ptr
, STARTING_EVT
);
538 * link_schedule_port - schedule port for deferred sending
539 * @l_ptr: pointer to link
540 * @origport: reference to sending port
541 * @sz: amount of data to be sent
543 * Schedules port for renewed sending of messages after link congestion
547 static int link_schedule_port(struct link
*l_ptr
, u32 origport
, u32 sz
)
551 spin_lock_bh(&tipc_port_list_lock
);
552 p_ptr
= tipc_port_lock(origport
);
556 if (!list_empty(&p_ptr
->wait_list
))
558 p_ptr
->congested_link
= l_ptr
;
559 p_ptr
->publ
.congested
= 1;
560 p_ptr
->waiting_pkts
= 1 + ((sz
- 1) / link_max_pkt(l_ptr
));
561 list_add_tail(&p_ptr
->wait_list
, &l_ptr
->waiting_ports
);
562 l_ptr
->stats
.link_congs
++;
564 tipc_port_unlock(p_ptr
);
566 spin_unlock_bh(&tipc_port_list_lock
);
570 void tipc_link_wakeup_ports(struct link
*l_ptr
, int all
)
573 struct port
*temp_p_ptr
;
574 int win
= l_ptr
->queue_limit
[0] - l_ptr
->out_queue_size
;
580 if (!spin_trylock_bh(&tipc_port_list_lock
))
582 if (link_congested(l_ptr
))
584 list_for_each_entry_safe(p_ptr
, temp_p_ptr
, &l_ptr
->waiting_ports
,
588 list_del_init(&p_ptr
->wait_list
);
589 p_ptr
->congested_link
= NULL
;
590 spin_lock_bh(p_ptr
->publ
.lock
);
591 p_ptr
->publ
.congested
= 0;
592 p_ptr
->wakeup(&p_ptr
->publ
);
593 win
-= p_ptr
->waiting_pkts
;
594 spin_unlock_bh(p_ptr
->publ
.lock
);
598 spin_unlock_bh(&tipc_port_list_lock
);
602 * link_release_outqueue - purge link's outbound message queue
603 * @l_ptr: pointer to link
606 static void link_release_outqueue(struct link
*l_ptr
)
608 struct sk_buff
*buf
= l_ptr
->first_out
;
609 struct sk_buff
*next
;
616 l_ptr
->first_out
= NULL
;
617 l_ptr
->out_queue_size
= 0;
621 * tipc_link_reset_fragments - purge link's inbound message fragments queue
622 * @l_ptr: pointer to link
625 void tipc_link_reset_fragments(struct link
*l_ptr
)
627 struct sk_buff
*buf
= l_ptr
->defragm_buf
;
628 struct sk_buff
*next
;
635 l_ptr
->defragm_buf
= NULL
;
639 * tipc_link_stop - purge all inbound and outbound messages associated with link
640 * @l_ptr: pointer to link
643 void tipc_link_stop(struct link
*l_ptr
)
646 struct sk_buff
*next
;
648 buf
= l_ptr
->oldest_deferred_in
;
655 buf
= l_ptr
->first_out
;
662 tipc_link_reset_fragments(l_ptr
);
664 buf_discard(l_ptr
->proto_msg_queue
);
665 l_ptr
->proto_msg_queue
= NULL
;
670 /* LINK EVENT CODE IS NOT SUPPORTED AT PRESENT */
672 static void link_recv_event(struct link_event
*ev
)
674 ev
->fcn(ev
->addr
, ev
->name
, ev
->up
);
678 static void link_send_event(void (*fcn
)(u32 a
, char *n
, int up
),
679 struct link
*l_ptr
, int up
)
681 struct link_event
*ev
;
683 ev
= kmalloc(sizeof(*ev
), GFP_ATOMIC
);
685 warn("Link event allocation failure\n");
688 ev
->addr
= l_ptr
->addr
;
691 memcpy(ev
->name
, l_ptr
->name
, TIPC_MAX_LINK_NAME
);
692 tipc_k_signal((Handler
)link_recv_event
, (unsigned long)ev
);
697 #define link_send_event(fcn, l_ptr, up) do { } while (0)
701 void tipc_link_reset(struct link
*l_ptr
)
704 u32 prev_state
= l_ptr
->state
;
705 u32 checkpoint
= l_ptr
->next_in_no
;
706 int was_active_link
= tipc_link_is_active(l_ptr
);
708 msg_set_session(l_ptr
->pmsg
, msg_session(l_ptr
->pmsg
) + 1);
710 /* Link is down, accept any session: */
711 l_ptr
->peer_session
= 0;
713 /* Prepare for max packet size negotiation */
714 link_init_max_pkt(l_ptr
);
716 l_ptr
->state
= RESET_UNKNOWN
;
717 dbg_link_state("Resetting Link\n");
719 if ((prev_state
== RESET_UNKNOWN
) || (prev_state
== RESET_RESET
))
722 tipc_node_link_down(l_ptr
->owner
, l_ptr
);
723 tipc_bearer_remove_dest(l_ptr
->b_ptr
, l_ptr
->addr
);
725 tipc_printf(TIPC_CONS
, "\nReset link <%s>\n", l_ptr
->name
);
728 if (was_active_link
&& tipc_node_has_active_links(l_ptr
->owner
) &&
729 l_ptr
->owner
->permit_changeover
) {
730 l_ptr
->reset_checkpoint
= checkpoint
;
731 l_ptr
->exp_msg_count
= START_CHANGEOVER
;
734 /* Clean up all queues: */
736 link_release_outqueue(l_ptr
);
737 buf_discard(l_ptr
->proto_msg_queue
);
738 l_ptr
->proto_msg_queue
= NULL
;
739 buf
= l_ptr
->oldest_deferred_in
;
741 struct sk_buff
*next
= buf
->next
;
745 if (!list_empty(&l_ptr
->waiting_ports
))
746 tipc_link_wakeup_ports(l_ptr
, 1);
748 l_ptr
->retransm_queue_head
= 0;
749 l_ptr
->retransm_queue_size
= 0;
750 l_ptr
->last_out
= NULL
;
751 l_ptr
->first_out
= NULL
;
752 l_ptr
->next_out
= NULL
;
753 l_ptr
->unacked_window
= 0;
754 l_ptr
->checkpoint
= 1;
755 l_ptr
->next_out_no
= 1;
756 l_ptr
->deferred_inqueue_sz
= 0;
757 l_ptr
->oldest_deferred_in
= NULL
;
758 l_ptr
->newest_deferred_in
= NULL
;
759 l_ptr
->fsm_msg_cnt
= 0;
760 l_ptr
->stale_count
= 0;
761 link_reset_statistics(l_ptr
);
763 link_send_event(tipc_cfg_link_event
, l_ptr
, 0);
764 if (!in_own_cluster(l_ptr
->addr
))
765 link_send_event(tipc_disc_link_event
, l_ptr
, 0);
769 static void link_activate(struct link
*l_ptr
)
771 l_ptr
->next_in_no
= l_ptr
->stats
.recv_info
= 1;
772 tipc_node_link_up(l_ptr
->owner
, l_ptr
);
773 tipc_bearer_add_dest(l_ptr
->b_ptr
, l_ptr
->addr
);
774 link_send_event(tipc_cfg_link_event
, l_ptr
, 1);
775 if (!in_own_cluster(l_ptr
->addr
))
776 link_send_event(tipc_disc_link_event
, l_ptr
, 1);
780 * link_state_event - link finite state machine
781 * @l_ptr: pointer to link
782 * @event: state machine event to process
785 static void link_state_event(struct link
*l_ptr
, unsigned event
)
788 u32 cont_intv
= l_ptr
->continuity_interval
;
790 if (!l_ptr
->started
&& (event
!= STARTING_EVT
))
791 return; /* Not yet. */
793 if (link_blocked(l_ptr
)) {
794 if (event
== TIMEOUT_EVT
) {
795 link_set_timer(l_ptr
, cont_intv
);
797 return; /* Changeover going on */
799 dbg_link("STATE_EV: <%s> ", l_ptr
->name
);
801 switch (l_ptr
->state
) {
802 case WORKING_WORKING
:
805 case TRAFFIC_MSG_EVT
:
813 if (l_ptr
->next_in_no
!= l_ptr
->checkpoint
) {
814 l_ptr
->checkpoint
= l_ptr
->next_in_no
;
815 if (tipc_bclink_acks_missing(l_ptr
->owner
)) {
816 tipc_link_send_proto_msg(l_ptr
, STATE_MSG
,
818 l_ptr
->fsm_msg_cnt
++;
819 } else if (l_ptr
->max_pkt
< l_ptr
->max_pkt_target
) {
820 tipc_link_send_proto_msg(l_ptr
, STATE_MSG
,
822 l_ptr
->fsm_msg_cnt
++;
824 link_set_timer(l_ptr
, cont_intv
);
827 dbg_link(" -> WU\n");
828 l_ptr
->state
= WORKING_UNKNOWN
;
829 l_ptr
->fsm_msg_cnt
= 0;
830 tipc_link_send_proto_msg(l_ptr
, STATE_MSG
, 1, 0, 0, 0, 0);
831 l_ptr
->fsm_msg_cnt
++;
832 link_set_timer(l_ptr
, cont_intv
/ 4);
835 dbg_link("RES -> RR\n");
836 info("Resetting link <%s>, requested by peer\n",
838 tipc_link_reset(l_ptr
);
839 l_ptr
->state
= RESET_RESET
;
840 l_ptr
->fsm_msg_cnt
= 0;
841 tipc_link_send_proto_msg(l_ptr
, ACTIVATE_MSG
, 0, 0, 0, 0, 0);
842 l_ptr
->fsm_msg_cnt
++;
843 link_set_timer(l_ptr
, cont_intv
);
846 err("Unknown link event %u in WW state\n", event
);
849 case WORKING_UNKNOWN
:
852 case TRAFFIC_MSG_EVT
:
855 dbg_link("ACT -> WW\n");
856 l_ptr
->state
= WORKING_WORKING
;
857 l_ptr
->fsm_msg_cnt
= 0;
858 link_set_timer(l_ptr
, cont_intv
);
861 dbg_link("RES -> RR\n");
862 info("Resetting link <%s>, requested by peer "
863 "while probing\n", l_ptr
->name
);
864 tipc_link_reset(l_ptr
);
865 l_ptr
->state
= RESET_RESET
;
866 l_ptr
->fsm_msg_cnt
= 0;
867 tipc_link_send_proto_msg(l_ptr
, ACTIVATE_MSG
, 0, 0, 0, 0, 0);
868 l_ptr
->fsm_msg_cnt
++;
869 link_set_timer(l_ptr
, cont_intv
);
873 if (l_ptr
->next_in_no
!= l_ptr
->checkpoint
) {
874 dbg_link("-> WW \n");
875 l_ptr
->state
= WORKING_WORKING
;
876 l_ptr
->fsm_msg_cnt
= 0;
877 l_ptr
->checkpoint
= l_ptr
->next_in_no
;
878 if (tipc_bclink_acks_missing(l_ptr
->owner
)) {
879 tipc_link_send_proto_msg(l_ptr
, STATE_MSG
,
881 l_ptr
->fsm_msg_cnt
++;
883 link_set_timer(l_ptr
, cont_intv
);
884 } else if (l_ptr
->fsm_msg_cnt
< l_ptr
->abort_limit
) {
885 dbg_link("Probing %u/%u,timer = %u ms)\n",
886 l_ptr
->fsm_msg_cnt
, l_ptr
->abort_limit
,
888 tipc_link_send_proto_msg(l_ptr
, STATE_MSG
,
890 l_ptr
->fsm_msg_cnt
++;
891 link_set_timer(l_ptr
, cont_intv
/ 4);
892 } else { /* Link has failed */
893 dbg_link("-> RU (%u probes unanswered)\n",
895 warn("Resetting link <%s>, peer not responding\n",
897 tipc_link_reset(l_ptr
);
898 l_ptr
->state
= RESET_UNKNOWN
;
899 l_ptr
->fsm_msg_cnt
= 0;
900 tipc_link_send_proto_msg(l_ptr
, RESET_MSG
,
902 l_ptr
->fsm_msg_cnt
++;
903 link_set_timer(l_ptr
, cont_intv
);
907 err("Unknown link event %u in WU state\n", event
);
913 case TRAFFIC_MSG_EVT
:
917 other
= l_ptr
->owner
->active_links
[0];
918 if (other
&& link_working_unknown(other
)) {
922 dbg_link("ACT -> WW\n");
923 l_ptr
->state
= WORKING_WORKING
;
924 l_ptr
->fsm_msg_cnt
= 0;
925 link_activate(l_ptr
);
926 tipc_link_send_proto_msg(l_ptr
, STATE_MSG
, 1, 0, 0, 0, 0);
927 l_ptr
->fsm_msg_cnt
++;
928 link_set_timer(l_ptr
, cont_intv
);
932 dbg_link(" -> RR\n");
933 l_ptr
->state
= RESET_RESET
;
934 l_ptr
->fsm_msg_cnt
= 0;
935 tipc_link_send_proto_msg(l_ptr
, ACTIVATE_MSG
, 1, 0, 0, 0, 0);
936 l_ptr
->fsm_msg_cnt
++;
937 link_set_timer(l_ptr
, cont_intv
);
945 tipc_link_send_proto_msg(l_ptr
, RESET_MSG
, 0, 0, 0, 0, 0);
946 l_ptr
->fsm_msg_cnt
++;
947 link_set_timer(l_ptr
, cont_intv
);
950 err("Unknown link event %u in RU state\n", event
);
956 case TRAFFIC_MSG_EVT
:
960 other
= l_ptr
->owner
->active_links
[0];
961 if (other
&& link_working_unknown(other
)) {
965 dbg_link("ACT -> WW\n");
966 l_ptr
->state
= WORKING_WORKING
;
967 l_ptr
->fsm_msg_cnt
= 0;
968 link_activate(l_ptr
);
969 tipc_link_send_proto_msg(l_ptr
, STATE_MSG
, 1, 0, 0, 0, 0);
970 l_ptr
->fsm_msg_cnt
++;
971 link_set_timer(l_ptr
, cont_intv
);
978 tipc_link_send_proto_msg(l_ptr
, ACTIVATE_MSG
, 0, 0, 0, 0, 0);
979 l_ptr
->fsm_msg_cnt
++;
980 link_set_timer(l_ptr
, cont_intv
);
981 dbg_link("fsm_msg_cnt %u\n", l_ptr
->fsm_msg_cnt
);
984 err("Unknown link event %u in RR state\n", event
);
988 err("Unknown link state %u/%u\n", l_ptr
->state
, event
);
993 * link_bundle_buf(): Append contents of a buffer to
994 * the tail of an existing one.
997 static int link_bundle_buf(struct link
*l_ptr
,
998 struct sk_buff
*bundler
,
1001 struct tipc_msg
*bundler_msg
= buf_msg(bundler
);
1002 struct tipc_msg
*msg
= buf_msg(buf
);
1003 u32 size
= msg_size(msg
);
1004 u32 bundle_size
= msg_size(bundler_msg
);
1005 u32 to_pos
= align(bundle_size
);
1006 u32 pad
= to_pos
- bundle_size
;
1008 if (msg_user(bundler_msg
) != MSG_BUNDLER
)
1010 if (msg_type(bundler_msg
) != OPEN_MSG
)
1012 if (skb_tailroom(bundler
) < (pad
+ size
))
1014 if (link_max_pkt(l_ptr
) < (to_pos
+ size
))
1017 skb_put(bundler
, pad
+ size
);
1018 skb_copy_to_linear_data_offset(bundler
, to_pos
, buf
->data
, size
);
1019 msg_set_size(bundler_msg
, to_pos
+ size
);
1020 msg_set_msgcnt(bundler_msg
, msg_msgcnt(bundler_msg
) + 1);
1021 dbg("Packed msg # %u(%u octets) into pos %u in buf(#%u)\n",
1022 msg_msgcnt(bundler_msg
), size
, to_pos
, msg_seqno(bundler_msg
));
1023 msg_dbg(msg
, "PACKD:");
1025 l_ptr
->stats
.sent_bundled
++;
1029 static void link_add_to_outqueue(struct link
*l_ptr
,
1030 struct sk_buff
*buf
,
1031 struct tipc_msg
*msg
)
1033 u32 ack
= mod(l_ptr
->next_in_no
- 1);
1034 u32 seqno
= mod(l_ptr
->next_out_no
++);
1036 msg_set_word(msg
, 2, ((ack
<< 16) | seqno
));
1037 msg_set_bcast_ack(msg
, l_ptr
->owner
->bclink
.last_in
);
1039 if (l_ptr
->first_out
) {
1040 l_ptr
->last_out
->next
= buf
;
1041 l_ptr
->last_out
= buf
;
1043 l_ptr
->first_out
= l_ptr
->last_out
= buf
;
1044 l_ptr
->out_queue_size
++;
1048 * tipc_link_send_buf() is the 'full path' for messages, called from
1049 * inside TIPC when the 'fast path' in tipc_send_buf
1050 * has failed, and from link_send()
1053 int tipc_link_send_buf(struct link
*l_ptr
, struct sk_buff
*buf
)
1055 struct tipc_msg
*msg
= buf_msg(buf
);
1056 u32 size
= msg_size(msg
);
1057 u32 dsz
= msg_data_sz(msg
);
1058 u32 queue_size
= l_ptr
->out_queue_size
;
1059 u32 imp
= msg_tot_importance(msg
);
1060 u32 queue_limit
= l_ptr
->queue_limit
[imp
];
1061 u32 max_packet
= link_max_pkt(l_ptr
);
1063 msg_set_prevnode(msg
, tipc_own_addr
); /* If routed message */
1065 /* Match msg importance against queue limits: */
1067 if (unlikely(queue_size
>= queue_limit
)) {
1068 if (imp
<= TIPC_CRITICAL_IMPORTANCE
) {
1069 return link_schedule_port(l_ptr
, msg_origport(msg
),
1072 msg_dbg(msg
, "TIPC: Congestion, throwing away\n");
1074 if (imp
> CONN_MANAGER
) {
1075 warn("Resetting link <%s>, send queue full", l_ptr
->name
);
1076 tipc_link_reset(l_ptr
);
1081 /* Fragmentation needed ? */
1083 if (size
> max_packet
)
1084 return tipc_link_send_long_buf(l_ptr
, buf
);
1086 /* Packet can be queued or sent: */
1088 if (queue_size
> l_ptr
->stats
.max_queue_sz
)
1089 l_ptr
->stats
.max_queue_sz
= queue_size
;
1091 if (likely(!tipc_bearer_congested(l_ptr
->b_ptr
, l_ptr
) &&
1092 !link_congested(l_ptr
))) {
1093 link_add_to_outqueue(l_ptr
, buf
, msg
);
1095 if (likely(tipc_bearer_send(l_ptr
->b_ptr
, buf
, &l_ptr
->media_addr
))) {
1096 l_ptr
->unacked_window
= 0;
1098 tipc_bearer_schedule(l_ptr
->b_ptr
, l_ptr
);
1099 l_ptr
->stats
.bearer_congs
++;
1100 l_ptr
->next_out
= buf
;
1104 /* Congestion: can message be bundled ?: */
1106 if ((msg_user(msg
) != CHANGEOVER_PROTOCOL
) &&
1107 (msg_user(msg
) != MSG_FRAGMENTER
)) {
1109 /* Try adding message to an existing bundle */
1111 if (l_ptr
->next_out
&&
1112 link_bundle_buf(l_ptr
, l_ptr
->last_out
, buf
)) {
1113 tipc_bearer_resolve_congestion(l_ptr
->b_ptr
, l_ptr
);
1117 /* Try creating a new bundle */
1119 if (size
<= max_packet
* 2 / 3) {
1120 struct sk_buff
*bundler
= buf_acquire(max_packet
);
1121 struct tipc_msg bundler_hdr
;
1124 msg_init(&bundler_hdr
, MSG_BUNDLER
, OPEN_MSG
,
1125 TIPC_OK
, INT_H_SIZE
, l_ptr
->addr
);
1126 skb_copy_to_linear_data(bundler
, &bundler_hdr
,
1128 skb_trim(bundler
, INT_H_SIZE
);
1129 link_bundle_buf(l_ptr
, bundler
, buf
);
1132 l_ptr
->stats
.sent_bundles
++;
1136 if (!l_ptr
->next_out
)
1137 l_ptr
->next_out
= buf
;
1138 link_add_to_outqueue(l_ptr
, buf
, msg
);
1139 tipc_bearer_resolve_congestion(l_ptr
->b_ptr
, l_ptr
);
1144 * tipc_link_send(): same as tipc_link_send_buf(), but the link to use has
1145 * not been selected yet, and the the owner node is not locked
1146 * Called by TIPC internal users, e.g. the name distributor
1149 int tipc_link_send(struct sk_buff
*buf
, u32 dest
, u32 selector
)
1153 int res
= -ELINKCONG
;
1155 read_lock_bh(&tipc_net_lock
);
1156 n_ptr
= tipc_node_select(dest
, selector
);
1158 tipc_node_lock(n_ptr
);
1159 l_ptr
= n_ptr
->active_links
[selector
& 1];
1161 dbg("tipc_link_send: found link %x for dest %x\n", l_ptr
, dest
);
1162 res
= tipc_link_send_buf(l_ptr
, buf
);
1164 dbg("Attempt to send msg to unreachable node:\n");
1165 msg_dbg(buf_msg(buf
),">>>");
1168 tipc_node_unlock(n_ptr
);
1170 dbg("Attempt to send msg to unknown node:\n");
1171 msg_dbg(buf_msg(buf
),">>>");
1174 read_unlock_bh(&tipc_net_lock
);
1179 * link_send_buf_fast: Entry for data messages where the
1180 * destination link is known and the header is complete,
1181 * inclusive total message length. Very time critical.
1182 * Link is locked. Returns user data length.
1185 static int link_send_buf_fast(struct link
*l_ptr
, struct sk_buff
*buf
,
1188 struct tipc_msg
*msg
= buf_msg(buf
);
1189 int res
= msg_data_sz(msg
);
1191 if (likely(!link_congested(l_ptr
))) {
1192 if (likely(msg_size(msg
) <= link_max_pkt(l_ptr
))) {
1193 if (likely(list_empty(&l_ptr
->b_ptr
->cong_links
))) {
1194 link_add_to_outqueue(l_ptr
, buf
, msg
);
1195 if (likely(tipc_bearer_send(l_ptr
->b_ptr
, buf
,
1196 &l_ptr
->media_addr
))) {
1197 l_ptr
->unacked_window
= 0;
1198 msg_dbg(msg
,"SENT_FAST:");
1201 dbg("failed sent fast...\n");
1202 tipc_bearer_schedule(l_ptr
->b_ptr
, l_ptr
);
1203 l_ptr
->stats
.bearer_congs
++;
1204 l_ptr
->next_out
= buf
;
1209 *used_max_pkt
= link_max_pkt(l_ptr
);
1211 return tipc_link_send_buf(l_ptr
, buf
); /* All other cases */
1215 * tipc_send_buf_fast: Entry for data messages where the
1216 * destination node is known and the header is complete,
1217 * inclusive total message length.
1218 * Returns user data length.
1220 int tipc_send_buf_fast(struct sk_buff
*buf
, u32 destnode
)
1225 u32 selector
= msg_origport(buf_msg(buf
)) & 1;
1228 if (destnode
== tipc_own_addr
)
1229 return tipc_port_recv_msg(buf
);
1231 read_lock_bh(&tipc_net_lock
);
1232 n_ptr
= tipc_node_select(destnode
, selector
);
1233 if (likely(n_ptr
)) {
1234 tipc_node_lock(n_ptr
);
1235 l_ptr
= n_ptr
->active_links
[selector
];
1236 dbg("send_fast: buf %x selected %x, destnode = %x\n",
1237 buf
, l_ptr
, destnode
);
1238 if (likely(l_ptr
)) {
1239 res
= link_send_buf_fast(l_ptr
, buf
, &dummy
);
1240 tipc_node_unlock(n_ptr
);
1241 read_unlock_bh(&tipc_net_lock
);
1244 tipc_node_unlock(n_ptr
);
1246 read_unlock_bh(&tipc_net_lock
);
1247 res
= msg_data_sz(buf_msg(buf
));
1248 tipc_reject_msg(buf
, TIPC_ERR_NO_NODE
);
1254 * tipc_link_send_sections_fast: Entry for messages where the
1255 * destination processor is known and the header is complete,
1256 * except for total message length.
1257 * Returns user data length or errno.
1259 int tipc_link_send_sections_fast(struct port
*sender
,
1260 struct iovec
const *msg_sect
,
1264 struct tipc_msg
*hdr
= &sender
->publ
.phdr
;
1266 struct sk_buff
*buf
;
1269 u32 selector
= msg_origport(hdr
) & 1;
1273 * Try building message using port's max_pkt hint.
1274 * (Must not hold any locks while building message.)
1277 res
= msg_build(hdr
, msg_sect
, num_sect
, sender
->publ
.max_pkt
,
1278 !sender
->user_port
, &buf
);
1280 read_lock_bh(&tipc_net_lock
);
1281 node
= tipc_node_select(destaddr
, selector
);
1283 tipc_node_lock(node
);
1284 l_ptr
= node
->active_links
[selector
];
1285 if (likely(l_ptr
)) {
1287 res
= link_send_buf_fast(l_ptr
, buf
,
1288 &sender
->publ
.max_pkt
);
1289 if (unlikely(res
< 0))
1292 tipc_node_unlock(node
);
1293 read_unlock_bh(&tipc_net_lock
);
1297 /* Exit if build request was invalid */
1299 if (unlikely(res
< 0))
1302 /* Exit if link (or bearer) is congested */
1304 if (link_congested(l_ptr
) ||
1305 !list_empty(&l_ptr
->b_ptr
->cong_links
)) {
1306 res
= link_schedule_port(l_ptr
,
1307 sender
->publ
.ref
, res
);
1312 * Message size exceeds max_pkt hint; update hint,
1313 * then re-try fast path or fragment the message
1316 sender
->publ
.max_pkt
= link_max_pkt(l_ptr
);
1317 tipc_node_unlock(node
);
1318 read_unlock_bh(&tipc_net_lock
);
1321 if ((msg_hdr_sz(hdr
) + res
) <= sender
->publ
.max_pkt
)
1324 return link_send_sections_long(sender
, msg_sect
,
1325 num_sect
, destaddr
);
1327 tipc_node_unlock(node
);
1329 read_unlock_bh(&tipc_net_lock
);
1331 /* Couldn't find a link to the destination node */
1334 return tipc_reject_msg(buf
, TIPC_ERR_NO_NODE
);
1336 return tipc_port_reject_sections(sender
, hdr
, msg_sect
, num_sect
,
1342 * link_send_sections_long(): Entry for long messages where the
1343 * destination node is known and the header is complete,
1344 * inclusive total message length.
1345 * Link and bearer congestion status have been checked to be ok,
1346 * and are ignored if they change.
1348 * Note that fragments do not use the full link MTU so that they won't have
1349 * to undergo refragmentation if link changeover causes them to be sent
1350 * over another link with an additional tunnel header added as prefix.
1351 * (Refragmentation will still occur if the other link has a smaller MTU.)
1353 * Returns user data length or errno.
1355 static int link_send_sections_long(struct port
*sender
,
1356 struct iovec
const *msg_sect
,
1362 struct tipc_msg
*hdr
= &sender
->publ
.phdr
;
1363 u32 dsz
= msg_data_sz(hdr
);
1364 u32 max_pkt
,fragm_sz
,rest
;
1365 struct tipc_msg fragm_hdr
;
1366 struct sk_buff
*buf
,*buf_chain
,*prev
;
1367 u32 fragm_crs
,fragm_rest
,hsz
,sect_rest
;
1368 const unchar
*sect_crs
;
1374 max_pkt
= sender
->publ
.max_pkt
- INT_H_SIZE
;
1375 /* leave room for tunnel header in case of link changeover */
1376 fragm_sz
= max_pkt
- INT_H_SIZE
;
1377 /* leave room for fragmentation header in each fragment */
1385 /* Prepare reusable fragment header: */
1387 msg_dbg(hdr
, ">FRAGMENTING>");
1388 msg_init(&fragm_hdr
, MSG_FRAGMENTER
, FIRST_FRAGMENT
,
1389 TIPC_OK
, INT_H_SIZE
, msg_destnode(hdr
));
1390 msg_set_link_selector(&fragm_hdr
, sender
->publ
.ref
);
1391 msg_set_size(&fragm_hdr
, max_pkt
);
1392 msg_set_fragm_no(&fragm_hdr
, 1);
1394 /* Prepare header of first fragment: */
1396 buf_chain
= buf
= buf_acquire(max_pkt
);
1400 skb_copy_to_linear_data(buf
, &fragm_hdr
, INT_H_SIZE
);
1401 hsz
= msg_hdr_sz(hdr
);
1402 skb_copy_to_linear_data_offset(buf
, INT_H_SIZE
, hdr
, hsz
);
1403 msg_dbg(buf_msg(buf
), ">BUILD>");
1405 /* Chop up message: */
1407 fragm_crs
= INT_H_SIZE
+ hsz
;
1408 fragm_rest
= fragm_sz
- hsz
;
1410 do { /* For all sections */
1414 sect_rest
= msg_sect
[++curr_sect
].iov_len
;
1415 sect_crs
= (const unchar
*)msg_sect
[curr_sect
].iov_base
;
1418 if (sect_rest
< fragm_rest
)
1423 if (likely(!sender
->user_port
)) {
1424 if (copy_from_user(buf
->data
+ fragm_crs
, sect_crs
, sz
)) {
1426 for (; buf_chain
; buf_chain
= buf
) {
1427 buf
= buf_chain
->next
;
1428 buf_discard(buf_chain
);
1433 skb_copy_to_linear_data_offset(buf
, fragm_crs
,
1441 if (!fragm_rest
&& rest
) {
1443 /* Initiate new fragment: */
1444 if (rest
<= fragm_sz
) {
1446 msg_set_type(&fragm_hdr
,LAST_FRAGMENT
);
1448 msg_set_type(&fragm_hdr
, FRAGMENT
);
1450 msg_set_size(&fragm_hdr
, fragm_sz
+ INT_H_SIZE
);
1451 msg_set_fragm_no(&fragm_hdr
, ++fragm_no
);
1453 buf
= buf_acquire(fragm_sz
+ INT_H_SIZE
);
1459 skb_copy_to_linear_data(buf
, &fragm_hdr
, INT_H_SIZE
);
1460 fragm_crs
= INT_H_SIZE
;
1461 fragm_rest
= fragm_sz
;
1462 msg_dbg(buf_msg(buf
)," >BUILD>");
1468 * Now we have a buffer chain. Select a link and check
1469 * that packet size is still OK
1471 node
= tipc_node_select(destaddr
, sender
->publ
.ref
& 1);
1473 tipc_node_lock(node
);
1474 l_ptr
= node
->active_links
[sender
->publ
.ref
& 1];
1476 tipc_node_unlock(node
);
1479 if (link_max_pkt(l_ptr
) < max_pkt
) {
1480 sender
->publ
.max_pkt
= link_max_pkt(l_ptr
);
1481 tipc_node_unlock(node
);
1482 for (; buf_chain
; buf_chain
= buf
) {
1483 buf
= buf_chain
->next
;
1484 buf_discard(buf_chain
);
1490 for (; buf_chain
; buf_chain
= buf
) {
1491 buf
= buf_chain
->next
;
1492 buf_discard(buf_chain
);
1494 return tipc_port_reject_sections(sender
, hdr
, msg_sect
, num_sect
,
1498 /* Append whole chain to send queue: */
1501 l_ptr
->long_msg_seq_no
= mod(l_ptr
->long_msg_seq_no
+ 1);
1502 if (!l_ptr
->next_out
)
1503 l_ptr
->next_out
= buf_chain
;
1504 l_ptr
->stats
.sent_fragmented
++;
1506 struct sk_buff
*next
= buf
->next
;
1507 struct tipc_msg
*msg
= buf_msg(buf
);
1509 l_ptr
->stats
.sent_fragments
++;
1510 msg_set_long_msgno(msg
, l_ptr
->long_msg_seq_no
);
1511 link_add_to_outqueue(l_ptr
, buf
, msg
);
1512 msg_dbg(msg
, ">ADD>");
1516 /* Send it, if possible: */
1518 tipc_link_push_queue(l_ptr
);
1519 tipc_node_unlock(node
);
1524 * tipc_link_push_packet: Push one unsent packet to the media
1526 u32
tipc_link_push_packet(struct link
*l_ptr
)
1528 struct sk_buff
*buf
= l_ptr
->first_out
;
1529 u32 r_q_size
= l_ptr
->retransm_queue_size
;
1530 u32 r_q_head
= l_ptr
->retransm_queue_head
;
1532 /* Step to position where retransmission failed, if any, */
1533 /* consider that buffers may have been released in meantime */
1535 if (r_q_size
&& buf
) {
1536 u32 last
= lesser(mod(r_q_head
+ r_q_size
),
1537 link_last_sent(l_ptr
));
1538 u32 first
= msg_seqno(buf_msg(buf
));
1540 while (buf
&& less(first
, r_q_head
)) {
1541 first
= mod(first
+ 1);
1544 l_ptr
->retransm_queue_head
= r_q_head
= first
;
1545 l_ptr
->retransm_queue_size
= r_q_size
= mod(last
- first
);
1548 /* Continue retransmission now, if there is anything: */
1550 if (r_q_size
&& buf
&& !skb_cloned(buf
)) {
1551 msg_set_ack(buf_msg(buf
), mod(l_ptr
->next_in_no
- 1));
1552 msg_set_bcast_ack(buf_msg(buf
), l_ptr
->owner
->bclink
.last_in
);
1553 if (tipc_bearer_send(l_ptr
->b_ptr
, buf
, &l_ptr
->media_addr
)) {
1554 msg_dbg(buf_msg(buf
), ">DEF-RETR>");
1555 l_ptr
->retransm_queue_head
= mod(++r_q_head
);
1556 l_ptr
->retransm_queue_size
= --r_q_size
;
1557 l_ptr
->stats
.retransmitted
++;
1560 l_ptr
->stats
.bearer_congs
++;
1561 msg_dbg(buf_msg(buf
), "|>DEF-RETR>");
1566 /* Send deferred protocol message, if any: */
1568 buf
= l_ptr
->proto_msg_queue
;
1570 msg_set_ack(buf_msg(buf
), mod(l_ptr
->next_in_no
- 1));
1571 msg_set_bcast_ack(buf_msg(buf
),l_ptr
->owner
->bclink
.last_in
);
1572 if (tipc_bearer_send(l_ptr
->b_ptr
, buf
, &l_ptr
->media_addr
)) {
1573 msg_dbg(buf_msg(buf
), ">DEF-PROT>");
1574 l_ptr
->unacked_window
= 0;
1576 l_ptr
->proto_msg_queue
= NULL
;
1579 msg_dbg(buf_msg(buf
), "|>DEF-PROT>");
1580 l_ptr
->stats
.bearer_congs
++;
1585 /* Send one deferred data message, if send window not full: */
1587 buf
= l_ptr
->next_out
;
1589 struct tipc_msg
*msg
= buf_msg(buf
);
1590 u32 next
= msg_seqno(msg
);
1591 u32 first
= msg_seqno(buf_msg(l_ptr
->first_out
));
1593 if (mod(next
- first
) < l_ptr
->queue_limit
[0]) {
1594 msg_set_ack(msg
, mod(l_ptr
->next_in_no
- 1));
1595 msg_set_bcast_ack(msg
, l_ptr
->owner
->bclink
.last_in
);
1596 if (tipc_bearer_send(l_ptr
->b_ptr
, buf
, &l_ptr
->media_addr
)) {
1597 if (msg_user(msg
) == MSG_BUNDLER
)
1598 msg_set_type(msg
, CLOSED_MSG
);
1599 msg_dbg(msg
, ">PUSH-DATA>");
1600 l_ptr
->next_out
= buf
->next
;
1603 msg_dbg(msg
, "|PUSH-DATA|");
1604 l_ptr
->stats
.bearer_congs
++;
1609 return PUSH_FINISHED
;
1613 * push_queue(): push out the unsent messages of a link where
1614 * congestion has abated. Node is locked
1616 void tipc_link_push_queue(struct link
*l_ptr
)
1620 if (tipc_bearer_congested(l_ptr
->b_ptr
, l_ptr
))
1624 res
= tipc_link_push_packet(l_ptr
);
1626 while (res
== TIPC_OK
);
1627 if (res
== PUSH_FAILED
)
1628 tipc_bearer_schedule(l_ptr
->b_ptr
, l_ptr
);
1631 static void link_reset_all(unsigned long addr
)
1634 char addr_string
[16];
1637 read_lock_bh(&tipc_net_lock
);
1638 n_ptr
= tipc_node_find((u32
)addr
);
1640 read_unlock_bh(&tipc_net_lock
);
1641 return; /* node no longer exists */
1644 tipc_node_lock(n_ptr
);
1646 warn("Resetting all links to %s\n",
1647 addr_string_fill(addr_string
, n_ptr
->addr
));
1649 for (i
= 0; i
< MAX_BEARERS
; i
++) {
1650 if (n_ptr
->links
[i
]) {
1651 link_print(n_ptr
->links
[i
], TIPC_OUTPUT
,
1652 "Resetting link\n");
1653 tipc_link_reset(n_ptr
->links
[i
]);
1657 tipc_node_unlock(n_ptr
);
1658 read_unlock_bh(&tipc_net_lock
);
1661 static void link_retransmit_failure(struct link
*l_ptr
, struct sk_buff
*buf
)
1663 struct tipc_msg
*msg
= buf_msg(buf
);
1665 warn("Retransmission failure on link <%s>\n", l_ptr
->name
);
1666 tipc_msg_dbg(TIPC_OUTPUT
, msg
, ">RETR-FAIL>");
1670 /* Handle failure on standard link */
1672 link_print(l_ptr
, TIPC_OUTPUT
, "Resetting link\n");
1673 tipc_link_reset(l_ptr
);
1677 /* Handle failure on broadcast link */
1680 char addr_string
[16];
1682 tipc_printf(TIPC_OUTPUT
, "Msg seq number: %u, ", msg_seqno(msg
));
1683 tipc_printf(TIPC_OUTPUT
, "Outstanding acks: %lu\n",
1684 (unsigned long) TIPC_SKB_CB(buf
)->handle
);
1686 n_ptr
= l_ptr
->owner
->next
;
1687 tipc_node_lock(n_ptr
);
1689 addr_string_fill(addr_string
, n_ptr
->addr
);
1690 tipc_printf(TIPC_OUTPUT
, "Multicast link info for %s\n", addr_string
);
1691 tipc_printf(TIPC_OUTPUT
, "Supported: %d, ", n_ptr
->bclink
.supported
);
1692 tipc_printf(TIPC_OUTPUT
, "Acked: %u\n", n_ptr
->bclink
.acked
);
1693 tipc_printf(TIPC_OUTPUT
, "Last in: %u, ", n_ptr
->bclink
.last_in
);
1694 tipc_printf(TIPC_OUTPUT
, "Gap after: %u, ", n_ptr
->bclink
.gap_after
);
1695 tipc_printf(TIPC_OUTPUT
, "Gap to: %u\n", n_ptr
->bclink
.gap_to
);
1696 tipc_printf(TIPC_OUTPUT
, "Nack sync: %u\n\n", n_ptr
->bclink
.nack_sync
);
1698 tipc_k_signal((Handler
)link_reset_all
, (unsigned long)n_ptr
->addr
);
1700 tipc_node_unlock(n_ptr
);
1702 l_ptr
->stale_count
= 0;
1706 void tipc_link_retransmit(struct link
*l_ptr
, struct sk_buff
*buf
,
1709 struct tipc_msg
*msg
;
1716 dbg("Retransmitting %u in link %x\n", retransmits
, l_ptr
);
1718 if (tipc_bearer_congested(l_ptr
->b_ptr
, l_ptr
)) {
1719 if (!skb_cloned(buf
)) {
1720 msg_dbg(msg
, ">NO_RETR->BCONG>");
1721 dbg_print_link(l_ptr
, " ");
1722 l_ptr
->retransm_queue_head
= msg_seqno(msg
);
1723 l_ptr
->retransm_queue_size
= retransmits
;
1726 /* Don't retransmit if driver already has the buffer */
1729 /* Detect repeated retransmit failures on uncongested bearer */
1731 if (l_ptr
->last_retransmitted
== msg_seqno(msg
)) {
1732 if (++l_ptr
->stale_count
> 100) {
1733 link_retransmit_failure(l_ptr
, buf
);
1737 l_ptr
->last_retransmitted
= msg_seqno(msg
);
1738 l_ptr
->stale_count
= 1;
1742 while (retransmits
&& (buf
!= l_ptr
->next_out
) && buf
&& !skb_cloned(buf
)) {
1744 msg_set_ack(msg
, mod(l_ptr
->next_in_no
- 1));
1745 msg_set_bcast_ack(msg
, l_ptr
->owner
->bclink
.last_in
);
1746 if (tipc_bearer_send(l_ptr
->b_ptr
, buf
, &l_ptr
->media_addr
)) {
1747 msg_dbg(buf_msg(buf
), ">RETR>");
1750 l_ptr
->stats
.retransmitted
++;
1752 tipc_bearer_schedule(l_ptr
->b_ptr
, l_ptr
);
1753 l_ptr
->stats
.bearer_congs
++;
1754 l_ptr
->retransm_queue_head
= msg_seqno(buf_msg(buf
));
1755 l_ptr
->retransm_queue_size
= retransmits
;
1760 l_ptr
->retransm_queue_head
= l_ptr
->retransm_queue_size
= 0;
1764 * link_recv_non_seq: Receive packets which are outside
1765 * the link sequence flow
1768 static void link_recv_non_seq(struct sk_buff
*buf
)
1770 struct tipc_msg
*msg
= buf_msg(buf
);
1772 if (msg_user(msg
) == LINK_CONFIG
)
1773 tipc_disc_recv_msg(buf
);
1775 tipc_bclink_recv_pkt(buf
);
1779 * link_insert_deferred_queue - insert deferred messages back into receive chain
1782 static struct sk_buff
*link_insert_deferred_queue(struct link
*l_ptr
,
1783 struct sk_buff
*buf
)
1787 if (l_ptr
->oldest_deferred_in
== NULL
)
1790 seq_no
= msg_seqno(buf_msg(l_ptr
->oldest_deferred_in
));
1791 if (seq_no
== mod(l_ptr
->next_in_no
)) {
1792 l_ptr
->newest_deferred_in
->next
= buf
;
1793 buf
= l_ptr
->oldest_deferred_in
;
1794 l_ptr
->oldest_deferred_in
= NULL
;
1795 l_ptr
->deferred_inqueue_sz
= 0;
1801 * link_recv_buf_validate - validate basic format of received message
1803 * This routine ensures a TIPC message has an acceptable header, and at least
1804 * as much data as the header indicates it should. The routine also ensures
1805 * that the entire message header is stored in the main fragment of the message
1806 * buffer, to simplify future access to message header fields.
1808 * Note: Having extra info present in the message header or data areas is OK.
1809 * TIPC will ignore the excess, under the assumption that it is optional info
1810 * introduced by a later release of the protocol.
1813 static int link_recv_buf_validate(struct sk_buff
*buf
)
1815 static u32 min_data_hdr_size
[8] = {
1816 SHORT_H_SIZE
, MCAST_H_SIZE
, LONG_H_SIZE
, DIR_MSG_H_SIZE
,
1817 MAX_H_SIZE
, MAX_H_SIZE
, MAX_H_SIZE
, MAX_H_SIZE
1820 struct tipc_msg
*msg
;
1826 if (unlikely(buf
->len
< MIN_H_SIZE
))
1829 msg
= skb_header_pointer(buf
, 0, sizeof(tipc_hdr
), tipc_hdr
);
1833 if (unlikely(msg_version(msg
) != TIPC_VERSION
))
1836 size
= msg_size(msg
);
1837 hdr_size
= msg_hdr_sz(msg
);
1838 min_hdr_size
= msg_isdata(msg
) ?
1839 min_data_hdr_size
[msg_type(msg
)] : INT_H_SIZE
;
1841 if (unlikely((hdr_size
< min_hdr_size
) ||
1842 (size
< hdr_size
) ||
1843 (buf
->len
< size
) ||
1844 (size
- hdr_size
> TIPC_MAX_USER_MSG_SIZE
)))
1847 return pskb_may_pull(buf
, hdr_size
);
1850 void tipc_recv_msg(struct sk_buff
*head
, struct tipc_bearer
*tb_ptr
)
1852 read_lock_bh(&tipc_net_lock
);
1854 struct bearer
*b_ptr
;
1857 struct sk_buff
*crs
;
1858 struct sk_buff
*buf
= head
;
1859 struct tipc_msg
*msg
;
1865 b_ptr
= (struct bearer
*)tb_ptr
;
1866 TIPC_SKB_CB(buf
)->handle
= b_ptr
;
1870 /* Ensure message is well-formed */
1872 if (unlikely(!link_recv_buf_validate(buf
)))
1875 /* Ensure message data is a single contiguous unit */
1877 if (unlikely(buf_linearize(buf
))) {
1881 /* Handle arrival of a non-unicast link message */
1885 if (unlikely(msg_non_seq(msg
))) {
1886 link_recv_non_seq(buf
);
1890 if (unlikely(!msg_short(msg
) &&
1891 (msg_destnode(msg
) != tipc_own_addr
)))
1894 /* Locate unicast link endpoint that should handle message */
1896 n_ptr
= tipc_node_find(msg_prevnode(msg
));
1897 if (unlikely(!n_ptr
))
1899 tipc_node_lock(n_ptr
);
1901 l_ptr
= n_ptr
->links
[b_ptr
->identity
];
1902 if (unlikely(!l_ptr
)) {
1903 tipc_node_unlock(n_ptr
);
1907 /* Validate message sequence number info */
1909 seq_no
= msg_seqno(msg
);
1910 ackd
= msg_ack(msg
);
1912 /* Release acked messages */
1914 if (less(n_ptr
->bclink
.acked
, msg_bcast_ack(msg
))) {
1915 if (tipc_node_is_up(n_ptr
) && n_ptr
->bclink
.supported
)
1916 tipc_bclink_acknowledge(n_ptr
, msg_bcast_ack(msg
));
1919 crs
= l_ptr
->first_out
;
1920 while ((crs
!= l_ptr
->next_out
) &&
1921 less_eq(msg_seqno(buf_msg(crs
)), ackd
)) {
1922 struct sk_buff
*next
= crs
->next
;
1929 l_ptr
->first_out
= crs
;
1930 l_ptr
->out_queue_size
-= released
;
1933 /* Try sending any messages link endpoint has pending */
1935 if (unlikely(l_ptr
->next_out
))
1936 tipc_link_push_queue(l_ptr
);
1937 if (unlikely(!list_empty(&l_ptr
->waiting_ports
)))
1938 tipc_link_wakeup_ports(l_ptr
, 0);
1939 if (unlikely(++l_ptr
->unacked_window
>= TIPC_MIN_LINK_WIN
)) {
1940 l_ptr
->stats
.sent_acks
++;
1941 tipc_link_send_proto_msg(l_ptr
, STATE_MSG
, 0, 0, 0, 0, 0);
1944 /* Now (finally!) process the incoming message */
1947 if (likely(link_working_working(l_ptr
))) {
1948 if (likely(seq_no
== mod(l_ptr
->next_in_no
))) {
1949 l_ptr
->next_in_no
++;
1950 if (unlikely(l_ptr
->oldest_deferred_in
))
1951 head
= link_insert_deferred_queue(l_ptr
,
1953 if (likely(msg_is_dest(msg
, tipc_own_addr
))) {
1955 if (likely(msg_isdata(msg
))) {
1956 tipc_node_unlock(n_ptr
);
1957 tipc_port_recv_msg(buf
);
1960 switch (msg_user(msg
)) {
1962 l_ptr
->stats
.recv_bundles
++;
1963 l_ptr
->stats
.recv_bundled
+=
1965 tipc_node_unlock(n_ptr
);
1966 tipc_link_recv_bundle(buf
);
1968 case ROUTE_DISTRIBUTOR
:
1969 tipc_node_unlock(n_ptr
);
1970 tipc_cltr_recv_routing_table(buf
);
1972 case NAME_DISTRIBUTOR
:
1973 tipc_node_unlock(n_ptr
);
1974 tipc_named_recv(buf
);
1977 tipc_node_unlock(n_ptr
);
1978 tipc_port_recv_proto_msg(buf
);
1980 case MSG_FRAGMENTER
:
1981 l_ptr
->stats
.recv_fragments
++;
1982 if (tipc_link_recv_fragment(&l_ptr
->defragm_buf
,
1984 l_ptr
->stats
.recv_fragmented
++;
1988 case CHANGEOVER_PROTOCOL
:
1989 type
= msg_type(msg
);
1990 if (link_recv_changeover_msg(&l_ptr
, &buf
)) {
1992 seq_no
= msg_seqno(msg
);
1993 TIPC_SKB_CB(buf
)->handle
1995 if (type
== ORIGINAL_MSG
)
1997 goto protocol_check
;
2002 tipc_node_unlock(n_ptr
);
2003 tipc_net_route_msg(buf
);
2006 link_handle_out_of_seq_msg(l_ptr
, buf
);
2007 head
= link_insert_deferred_queue(l_ptr
, head
);
2008 tipc_node_unlock(n_ptr
);
2012 if (msg_user(msg
) == LINK_PROTOCOL
) {
2013 link_recv_proto_msg(l_ptr
, buf
);
2014 head
= link_insert_deferred_queue(l_ptr
, head
);
2015 tipc_node_unlock(n_ptr
);
2018 msg_dbg(msg
,"NSEQ<REC<");
2019 link_state_event(l_ptr
, TRAFFIC_MSG_EVT
);
2021 if (link_working_working(l_ptr
)) {
2022 /* Re-insert in front of queue */
2023 msg_dbg(msg
,"RECV-REINS:");
2026 tipc_node_unlock(n_ptr
);
2029 tipc_node_unlock(n_ptr
);
2033 read_unlock_bh(&tipc_net_lock
);
2037 * link_defer_buf(): Sort a received out-of-sequence packet
2038 * into the deferred reception queue.
2039 * Returns the increase of the queue length,i.e. 0 or 1
2042 u32
tipc_link_defer_pkt(struct sk_buff
**head
,
2043 struct sk_buff
**tail
,
2044 struct sk_buff
*buf
)
2046 struct sk_buff
*prev
= NULL
;
2047 struct sk_buff
*crs
= *head
;
2048 u32 seq_no
= msg_seqno(buf_msg(buf
));
2053 if (*head
== NULL
) {
2054 *head
= *tail
= buf
;
2059 if (less(msg_seqno(buf_msg(*tail
)), seq_no
)) {
2060 (*tail
)->next
= buf
;
2065 /* Scan through queue and sort it in */
2067 struct tipc_msg
*msg
= buf_msg(crs
);
2069 if (less(seq_no
, msg_seqno(msg
))) {
2077 if (seq_no
== msg_seqno(msg
)) {
2085 /* Message is a duplicate of an existing message */
2092 * link_handle_out_of_seq_msg - handle arrival of out-of-sequence packet
2095 static void link_handle_out_of_seq_msg(struct link
*l_ptr
,
2096 struct sk_buff
*buf
)
2098 u32 seq_no
= msg_seqno(buf_msg(buf
));
2100 if (likely(msg_user(buf_msg(buf
)) == LINK_PROTOCOL
)) {
2101 link_recv_proto_msg(l_ptr
, buf
);
2105 dbg("rx OOS msg: seq_no %u, expecting %u (%u)\n",
2106 seq_no
, mod(l_ptr
->next_in_no
), l_ptr
->next_in_no
);
2108 /* Record OOS packet arrival (force mismatch on next timeout) */
2110 l_ptr
->checkpoint
--;
2113 * Discard packet if a duplicate; otherwise add it to deferred queue
2114 * and notify peer of gap as per protocol specification
2117 if (less(seq_no
, mod(l_ptr
->next_in_no
))) {
2118 l_ptr
->stats
.duplicates
++;
2123 if (tipc_link_defer_pkt(&l_ptr
->oldest_deferred_in
,
2124 &l_ptr
->newest_deferred_in
, buf
)) {
2125 l_ptr
->deferred_inqueue_sz
++;
2126 l_ptr
->stats
.deferred_recv
++;
2127 if ((l_ptr
->deferred_inqueue_sz
% 16) == 1)
2128 tipc_link_send_proto_msg(l_ptr
, STATE_MSG
, 0, 0, 0, 0, 0);
2130 l_ptr
->stats
.duplicates
++;
2134 * Send protocol message to the other endpoint.
2136 void tipc_link_send_proto_msg(struct link
*l_ptr
, u32 msg_typ
, int probe_msg
,
2137 u32 gap
, u32 tolerance
, u32 priority
, u32 ack_mtu
)
2139 struct sk_buff
*buf
= NULL
;
2140 struct tipc_msg
*msg
= l_ptr
->pmsg
;
2141 u32 msg_size
= sizeof(l_ptr
->proto_msg
);
2143 if (link_blocked(l_ptr
))
2145 msg_set_type(msg
, msg_typ
);
2146 msg_set_net_plane(msg
, l_ptr
->b_ptr
->net_plane
);
2147 msg_set_bcast_ack(msg
, mod(l_ptr
->owner
->bclink
.last_in
));
2148 msg_set_last_bcast(msg
, tipc_bclink_get_last_sent());
2150 if (msg_typ
== STATE_MSG
) {
2151 u32 next_sent
= mod(l_ptr
->next_out_no
);
2153 if (!tipc_link_is_up(l_ptr
))
2155 if (l_ptr
->next_out
)
2156 next_sent
= msg_seqno(buf_msg(l_ptr
->next_out
));
2157 msg_set_next_sent(msg
, next_sent
);
2158 if (l_ptr
->oldest_deferred_in
) {
2159 u32 rec
= msg_seqno(buf_msg(l_ptr
->oldest_deferred_in
));
2160 gap
= mod(rec
- mod(l_ptr
->next_in_no
));
2162 msg_set_seq_gap(msg
, gap
);
2164 l_ptr
->stats
.sent_nacks
++;
2165 msg_set_link_tolerance(msg
, tolerance
);
2166 msg_set_linkprio(msg
, priority
);
2167 msg_set_max_pkt(msg
, ack_mtu
);
2168 msg_set_ack(msg
, mod(l_ptr
->next_in_no
- 1));
2169 msg_set_probe(msg
, probe_msg
!= 0);
2171 u32 mtu
= l_ptr
->max_pkt
;
2173 if ((mtu
< l_ptr
->max_pkt_target
) &&
2174 link_working_working(l_ptr
) &&
2175 l_ptr
->fsm_msg_cnt
) {
2176 msg_size
= (mtu
+ (l_ptr
->max_pkt_target
- mtu
)/2 + 2) & ~3;
2177 if (l_ptr
->max_pkt_probes
== 10) {
2178 l_ptr
->max_pkt_target
= (msg_size
- 4);
2179 l_ptr
->max_pkt_probes
= 0;
2180 msg_size
= (mtu
+ (l_ptr
->max_pkt_target
- mtu
)/2 + 2) & ~3;
2182 l_ptr
->max_pkt_probes
++;
2185 l_ptr
->stats
.sent_probes
++;
2187 l_ptr
->stats
.sent_states
++;
2188 } else { /* RESET_MSG or ACTIVATE_MSG */
2189 msg_set_ack(msg
, mod(l_ptr
->reset_checkpoint
- 1));
2190 msg_set_seq_gap(msg
, 0);
2191 msg_set_next_sent(msg
, 1);
2192 msg_set_link_tolerance(msg
, l_ptr
->tolerance
);
2193 msg_set_linkprio(msg
, l_ptr
->priority
);
2194 msg_set_max_pkt(msg
, l_ptr
->max_pkt_target
);
2197 if (tipc_node_has_redundant_links(l_ptr
->owner
)) {
2198 msg_set_redundant_link(msg
);
2200 msg_clear_redundant_link(msg
);
2202 msg_set_linkprio(msg
, l_ptr
->priority
);
2204 /* Ensure sequence number will not fit : */
2206 msg_set_seqno(msg
, mod(l_ptr
->next_out_no
+ (0xffff/2)));
2210 if (tipc_bearer_congested(l_ptr
->b_ptr
, l_ptr
)) {
2211 if (!l_ptr
->proto_msg_queue
) {
2212 l_ptr
->proto_msg_queue
=
2213 buf_acquire(sizeof(l_ptr
->proto_msg
));
2215 buf
= l_ptr
->proto_msg_queue
;
2218 skb_copy_to_linear_data(buf
, msg
, sizeof(l_ptr
->proto_msg
));
2221 msg_set_timestamp(msg
, jiffies_to_msecs(jiffies
));
2223 /* Message can be sent */
2227 buf
= buf_acquire(msg_size
);
2231 skb_copy_to_linear_data(buf
, msg
, sizeof(l_ptr
->proto_msg
));
2232 msg_set_size(buf_msg(buf
), msg_size
);
2234 if (tipc_bearer_send(l_ptr
->b_ptr
, buf
, &l_ptr
->media_addr
)) {
2235 l_ptr
->unacked_window
= 0;
2240 /* New congestion */
2241 tipc_bearer_schedule(l_ptr
->b_ptr
, l_ptr
);
2242 l_ptr
->proto_msg_queue
= buf
;
2243 l_ptr
->stats
.bearer_congs
++;
2247 * Receive protocol message :
2248 * Note that network plane id propagates through the network, and may
2249 * change at any time. The node with lowest address rules
2252 static void link_recv_proto_msg(struct link
*l_ptr
, struct sk_buff
*buf
)
2258 struct tipc_msg
*msg
= buf_msg(buf
);
2260 dbg("AT(%u):", jiffies_to_msecs(jiffies
));
2262 if (link_blocked(l_ptr
))
2265 /* record unnumbered packet arrival (force mismatch on next timeout) */
2267 l_ptr
->checkpoint
--;
2269 if (l_ptr
->b_ptr
->net_plane
!= msg_net_plane(msg
))
2270 if (tipc_own_addr
> msg_prevnode(msg
))
2271 l_ptr
->b_ptr
->net_plane
= msg_net_plane(msg
);
2273 l_ptr
->owner
->permit_changeover
= msg_redundant_link(msg
);
2275 switch (msg_type(msg
)) {
2278 if (!link_working_unknown(l_ptr
) && l_ptr
->peer_session
) {
2279 if (msg_session(msg
) == l_ptr
->peer_session
) {
2280 dbg("Duplicate RESET: %u<->%u\n",
2281 msg_session(msg
), l_ptr
->peer_session
);
2282 break; /* duplicate: ignore */
2287 /* Update link settings according other endpoint's values */
2289 strcpy((strrchr(l_ptr
->name
, ':') + 1), (char *)msg_data(msg
));
2291 if ((msg_tol
= msg_link_tolerance(msg
)) &&
2292 (msg_tol
> l_ptr
->tolerance
))
2293 link_set_supervision_props(l_ptr
, msg_tol
);
2295 if (msg_linkprio(msg
) > l_ptr
->priority
)
2296 l_ptr
->priority
= msg_linkprio(msg
);
2298 max_pkt_info
= msg_max_pkt(msg
);
2300 if (max_pkt_info
< l_ptr
->max_pkt_target
)
2301 l_ptr
->max_pkt_target
= max_pkt_info
;
2302 if (l_ptr
->max_pkt
> l_ptr
->max_pkt_target
)
2303 l_ptr
->max_pkt
= l_ptr
->max_pkt_target
;
2305 l_ptr
->max_pkt
= l_ptr
->max_pkt_target
;
2307 l_ptr
->owner
->bclink
.supported
= (max_pkt_info
!= 0);
2309 link_state_event(l_ptr
, msg_type(msg
));
2311 l_ptr
->peer_session
= msg_session(msg
);
2312 l_ptr
->peer_bearer_id
= msg_bearer_id(msg
);
2314 /* Synchronize broadcast sequence numbers */
2315 if (!tipc_node_has_redundant_links(l_ptr
->owner
)) {
2316 l_ptr
->owner
->bclink
.last_in
= mod(msg_last_bcast(msg
));
2321 if ((msg_tol
= msg_link_tolerance(msg
)))
2322 link_set_supervision_props(l_ptr
, msg_tol
);
2324 if (msg_linkprio(msg
) &&
2325 (msg_linkprio(msg
) != l_ptr
->priority
)) {
2326 warn("Resetting link <%s>, priority change %u->%u\n",
2327 l_ptr
->name
, l_ptr
->priority
, msg_linkprio(msg
));
2328 l_ptr
->priority
= msg_linkprio(msg
);
2329 tipc_link_reset(l_ptr
); /* Enforce change to take effect */
2332 link_state_event(l_ptr
, TRAFFIC_MSG_EVT
);
2333 l_ptr
->stats
.recv_states
++;
2334 if (link_reset_unknown(l_ptr
))
2337 if (less_eq(mod(l_ptr
->next_in_no
), msg_next_sent(msg
))) {
2338 rec_gap
= mod(msg_next_sent(msg
) -
2339 mod(l_ptr
->next_in_no
));
2342 max_pkt_ack
= msg_max_pkt(msg
);
2343 if (max_pkt_ack
> l_ptr
->max_pkt
) {
2344 dbg("Link <%s> updated MTU %u -> %u\n",
2345 l_ptr
->name
, l_ptr
->max_pkt
, max_pkt_ack
);
2346 l_ptr
->max_pkt
= max_pkt_ack
;
2347 l_ptr
->max_pkt_probes
= 0;
2351 if (msg_probe(msg
)) {
2352 l_ptr
->stats
.recv_probes
++;
2353 if (msg_size(msg
) > sizeof(l_ptr
->proto_msg
)) {
2354 max_pkt_ack
= msg_size(msg
);
2358 /* Protocol message before retransmits, reduce loss risk */
2360 tipc_bclink_check_gap(l_ptr
->owner
, msg_last_bcast(msg
));
2362 if (rec_gap
|| (msg_probe(msg
))) {
2363 tipc_link_send_proto_msg(l_ptr
, STATE_MSG
,
2364 0, rec_gap
, 0, 0, max_pkt_ack
);
2366 if (msg_seq_gap(msg
)) {
2367 msg_dbg(msg
, "With Gap:");
2368 l_ptr
->stats
.recv_nacks
++;
2369 tipc_link_retransmit(l_ptr
, l_ptr
->first_out
,
2374 msg_dbg(buf_msg(buf
), "<DISCARDING UNKNOWN<");
2382 * tipc_link_tunnel(): Send one message via a link belonging to
2383 * another bearer. Owner node is locked.
2385 void tipc_link_tunnel(struct link
*l_ptr
,
2386 struct tipc_msg
*tunnel_hdr
,
2387 struct tipc_msg
*msg
,
2390 struct link
*tunnel
;
2391 struct sk_buff
*buf
;
2392 u32 length
= msg_size(msg
);
2394 tunnel
= l_ptr
->owner
->active_links
[selector
& 1];
2395 if (!tipc_link_is_up(tunnel
)) {
2396 warn("Link changeover error, "
2397 "tunnel link no longer available\n");
2400 msg_set_size(tunnel_hdr
, length
+ INT_H_SIZE
);
2401 buf
= buf_acquire(length
+ INT_H_SIZE
);
2403 warn("Link changeover error, "
2404 "unable to send tunnel msg\n");
2407 skb_copy_to_linear_data(buf
, tunnel_hdr
, INT_H_SIZE
);
2408 skb_copy_to_linear_data_offset(buf
, INT_H_SIZE
, msg
, length
);
2409 dbg("%c->%c:", l_ptr
->b_ptr
->net_plane
, tunnel
->b_ptr
->net_plane
);
2410 msg_dbg(buf_msg(buf
), ">SEND>");
2411 tipc_link_send_buf(tunnel
, buf
);
2417 * changeover(): Send whole message queue via the remaining link
2418 * Owner node is locked.
2421 void tipc_link_changeover(struct link
*l_ptr
)
2423 u32 msgcount
= l_ptr
->out_queue_size
;
2424 struct sk_buff
*crs
= l_ptr
->first_out
;
2425 struct link
*tunnel
= l_ptr
->owner
->active_links
[0];
2426 struct tipc_msg tunnel_hdr
;
2432 if (!l_ptr
->owner
->permit_changeover
) {
2433 warn("Link changeover error, "
2434 "peer did not permit changeover\n");
2438 msg_init(&tunnel_hdr
, CHANGEOVER_PROTOCOL
,
2439 ORIGINAL_MSG
, TIPC_OK
, INT_H_SIZE
, l_ptr
->addr
);
2440 msg_set_bearer_id(&tunnel_hdr
, l_ptr
->peer_bearer_id
);
2441 msg_set_msgcnt(&tunnel_hdr
, msgcount
);
2442 dbg("Link changeover requires %u tunnel messages\n", msgcount
);
2444 if (!l_ptr
->first_out
) {
2445 struct sk_buff
*buf
;
2447 buf
= buf_acquire(INT_H_SIZE
);
2449 skb_copy_to_linear_data(buf
, &tunnel_hdr
, INT_H_SIZE
);
2450 msg_set_size(&tunnel_hdr
, INT_H_SIZE
);
2451 dbg("%c->%c:", l_ptr
->b_ptr
->net_plane
,
2452 tunnel
->b_ptr
->net_plane
);
2453 msg_dbg(&tunnel_hdr
, "EMPTY>SEND>");
2454 tipc_link_send_buf(tunnel
, buf
);
2456 warn("Link changeover error, "
2457 "unable to send changeover msg\n");
2462 split_bundles
= (l_ptr
->owner
->active_links
[0] !=
2463 l_ptr
->owner
->active_links
[1]);
2466 struct tipc_msg
*msg
= buf_msg(crs
);
2468 if ((msg_user(msg
) == MSG_BUNDLER
) && split_bundles
) {
2469 struct tipc_msg
*m
= msg_get_wrapped(msg
);
2470 unchar
* pos
= (unchar
*)m
;
2472 msgcount
= msg_msgcnt(msg
);
2473 while (msgcount
--) {
2474 msg_set_seqno(m
,msg_seqno(msg
));
2475 tipc_link_tunnel(l_ptr
, &tunnel_hdr
, m
,
2476 msg_link_selector(m
));
2477 pos
+= align(msg_size(m
));
2478 m
= (struct tipc_msg
*)pos
;
2481 tipc_link_tunnel(l_ptr
, &tunnel_hdr
, msg
,
2482 msg_link_selector(msg
));
2488 void tipc_link_send_duplicate(struct link
*l_ptr
, struct link
*tunnel
)
2490 struct sk_buff
*iter
;
2491 struct tipc_msg tunnel_hdr
;
2493 msg_init(&tunnel_hdr
, CHANGEOVER_PROTOCOL
,
2494 DUPLICATE_MSG
, TIPC_OK
, INT_H_SIZE
, l_ptr
->addr
);
2495 msg_set_msgcnt(&tunnel_hdr
, l_ptr
->out_queue_size
);
2496 msg_set_bearer_id(&tunnel_hdr
, l_ptr
->peer_bearer_id
);
2497 iter
= l_ptr
->first_out
;
2499 struct sk_buff
*outbuf
;
2500 struct tipc_msg
*msg
= buf_msg(iter
);
2501 u32 length
= msg_size(msg
);
2503 if (msg_user(msg
) == MSG_BUNDLER
)
2504 msg_set_type(msg
, CLOSED_MSG
);
2505 msg_set_ack(msg
, mod(l_ptr
->next_in_no
- 1)); /* Update */
2506 msg_set_bcast_ack(msg
, l_ptr
->owner
->bclink
.last_in
);
2507 msg_set_size(&tunnel_hdr
, length
+ INT_H_SIZE
);
2508 outbuf
= buf_acquire(length
+ INT_H_SIZE
);
2509 if (outbuf
== NULL
) {
2510 warn("Link changeover error, "
2511 "unable to send duplicate msg\n");
2514 skb_copy_to_linear_data(outbuf
, &tunnel_hdr
, INT_H_SIZE
);
2515 skb_copy_to_linear_data_offset(outbuf
, INT_H_SIZE
, iter
->data
,
2517 dbg("%c->%c:", l_ptr
->b_ptr
->net_plane
,
2518 tunnel
->b_ptr
->net_plane
);
2519 msg_dbg(buf_msg(outbuf
), ">SEND>");
2520 tipc_link_send_buf(tunnel
, outbuf
);
2521 if (!tipc_link_is_up(l_ptr
))
2530 * buf_extract - extracts embedded TIPC message from another message
2531 * @skb: encapsulating message buffer
2532 * @from_pos: offset to extract from
2534 * Returns a new message buffer containing an embedded message. The
2535 * encapsulating message itself is left unchanged.
2538 static struct sk_buff
*buf_extract(struct sk_buff
*skb
, u32 from_pos
)
2540 struct tipc_msg
*msg
= (struct tipc_msg
*)(skb
->data
+ from_pos
);
2541 u32 size
= msg_size(msg
);
2544 eb
= buf_acquire(size
);
2546 skb_copy_to_linear_data(eb
, msg
, size
);
2551 * link_recv_changeover_msg(): Receive tunneled packet sent
2552 * via other link. Node is locked. Return extracted buffer.
2555 static int link_recv_changeover_msg(struct link
**l_ptr
,
2556 struct sk_buff
**buf
)
2558 struct sk_buff
*tunnel_buf
= *buf
;
2559 struct link
*dest_link
;
2560 struct tipc_msg
*msg
;
2561 struct tipc_msg
*tunnel_msg
= buf_msg(tunnel_buf
);
2562 u32 msg_typ
= msg_type(tunnel_msg
);
2563 u32 msg_count
= msg_msgcnt(tunnel_msg
);
2565 dest_link
= (*l_ptr
)->owner
->links
[msg_bearer_id(tunnel_msg
)];
2567 msg_dbg(tunnel_msg
, "NOLINK/<REC<");
2570 if (dest_link
== *l_ptr
) {
2571 err("Unexpected changeover message on link <%s>\n",
2575 dbg("%c<-%c:", dest_link
->b_ptr
->net_plane
,
2576 (*l_ptr
)->b_ptr
->net_plane
);
2578 msg
= msg_get_wrapped(tunnel_msg
);
2580 if (msg_typ
== DUPLICATE_MSG
) {
2581 if (less(msg_seqno(msg
), mod(dest_link
->next_in_no
))) {
2582 msg_dbg(tunnel_msg
, "DROP/<REC<");
2585 *buf
= buf_extract(tunnel_buf
,INT_H_SIZE
);
2587 warn("Link changeover error, duplicate msg dropped\n");
2590 msg_dbg(tunnel_msg
, "TNL<REC<");
2591 buf_discard(tunnel_buf
);
2595 /* First original message ?: */
2597 if (tipc_link_is_up(dest_link
)) {
2598 msg_dbg(tunnel_msg
, "UP/FIRST/<REC<");
2599 info("Resetting link <%s>, changeover initiated by peer\n",
2601 tipc_link_reset(dest_link
);
2602 dest_link
->exp_msg_count
= msg_count
;
2603 dbg("Expecting %u tunnelled messages\n", msg_count
);
2606 } else if (dest_link
->exp_msg_count
== START_CHANGEOVER
) {
2607 msg_dbg(tunnel_msg
, "BLK/FIRST/<REC<");
2608 dest_link
->exp_msg_count
= msg_count
;
2609 dbg("Expecting %u tunnelled messages\n", msg_count
);
2614 /* Receive original message */
2616 if (dest_link
->exp_msg_count
== 0) {
2617 warn("Link switchover error, "
2618 "got too many tunnelled messages\n");
2619 msg_dbg(tunnel_msg
, "OVERDUE/DROP/<REC<");
2620 dbg_print_link(dest_link
, "LINK:");
2623 dest_link
->exp_msg_count
--;
2624 if (less(msg_seqno(msg
), dest_link
->reset_checkpoint
)) {
2625 msg_dbg(tunnel_msg
, "DROP/DUPL/<REC<");
2628 *buf
= buf_extract(tunnel_buf
, INT_H_SIZE
);
2630 msg_dbg(tunnel_msg
, "TNL<REC<");
2631 buf_discard(tunnel_buf
);
2634 warn("Link changeover error, original msg dropped\n");
2639 buf_discard(tunnel_buf
);
2644 * Bundler functionality:
2646 void tipc_link_recv_bundle(struct sk_buff
*buf
)
2648 u32 msgcount
= msg_msgcnt(buf_msg(buf
));
2649 u32 pos
= INT_H_SIZE
;
2650 struct sk_buff
*obuf
;
2652 msg_dbg(buf_msg(buf
), "<BNDL<: ");
2653 while (msgcount
--) {
2654 obuf
= buf_extract(buf
, pos
);
2656 warn("Link unable to unbundle message(s)\n");
2659 pos
+= align(msg_size(buf_msg(obuf
)));
2660 msg_dbg(buf_msg(obuf
), " /");
2661 tipc_net_route_msg(obuf
);
2667 * Fragmentation/defragmentation:
2672 * tipc_link_send_long_buf: Entry for buffers needing fragmentation.
2673 * The buffer is complete, inclusive total message length.
2674 * Returns user data length.
2676 int tipc_link_send_long_buf(struct link
*l_ptr
, struct sk_buff
*buf
)
2678 struct tipc_msg
*inmsg
= buf_msg(buf
);
2679 struct tipc_msg fragm_hdr
;
2680 u32 insize
= msg_size(inmsg
);
2681 u32 dsz
= msg_data_sz(inmsg
);
2682 unchar
*crs
= buf
->data
;
2684 u32 pack_sz
= link_max_pkt(l_ptr
);
2685 u32 fragm_sz
= pack_sz
- INT_H_SIZE
;
2687 u32 destaddr
= msg_destnode(inmsg
);
2689 if (msg_short(inmsg
))
2690 destaddr
= l_ptr
->addr
;
2692 if (msg_routed(inmsg
))
2693 msg_set_prevnode(inmsg
, tipc_own_addr
);
2695 /* Prepare reusable fragment header: */
2697 msg_init(&fragm_hdr
, MSG_FRAGMENTER
, FIRST_FRAGMENT
,
2698 TIPC_OK
, INT_H_SIZE
, destaddr
);
2699 msg_set_link_selector(&fragm_hdr
, msg_link_selector(inmsg
));
2700 msg_set_long_msgno(&fragm_hdr
, mod(l_ptr
->long_msg_seq_no
++));
2701 msg_set_fragm_no(&fragm_hdr
, fragm_no
);
2702 l_ptr
->stats
.sent_fragmented
++;
2704 /* Chop up message: */
2707 struct sk_buff
*fragm
;
2709 if (rest
<= fragm_sz
) {
2711 msg_set_type(&fragm_hdr
, LAST_FRAGMENT
);
2713 fragm
= buf_acquire(fragm_sz
+ INT_H_SIZE
);
2714 if (fragm
== NULL
) {
2715 warn("Link unable to fragment message\n");
2719 msg_set_size(&fragm_hdr
, fragm_sz
+ INT_H_SIZE
);
2720 skb_copy_to_linear_data(fragm
, &fragm_hdr
, INT_H_SIZE
);
2721 skb_copy_to_linear_data_offset(fragm
, INT_H_SIZE
, crs
,
2723 /* Send queued messages first, if any: */
2725 l_ptr
->stats
.sent_fragments
++;
2726 tipc_link_send_buf(l_ptr
, fragm
);
2727 if (!tipc_link_is_up(l_ptr
))
2729 msg_set_fragm_no(&fragm_hdr
, ++fragm_no
);
2732 msg_set_type(&fragm_hdr
, FRAGMENT
);
2740 * A pending message being re-assembled must store certain values
2741 * to handle subsequent fragments correctly. The following functions
2742 * help storing these values in unused, available fields in the
2743 * pending message. This makes dynamic memory allocation unecessary.
2746 static void set_long_msg_seqno(struct sk_buff
*buf
, u32 seqno
)
2748 msg_set_seqno(buf_msg(buf
), seqno
);
2751 static u32
get_fragm_size(struct sk_buff
*buf
)
2753 return msg_ack(buf_msg(buf
));
2756 static void set_fragm_size(struct sk_buff
*buf
, u32 sz
)
2758 msg_set_ack(buf_msg(buf
), sz
);
2761 static u32
get_expected_frags(struct sk_buff
*buf
)
2763 return msg_bcast_ack(buf_msg(buf
));
2766 static void set_expected_frags(struct sk_buff
*buf
, u32 exp
)
2768 msg_set_bcast_ack(buf_msg(buf
), exp
);
2771 static u32
get_timer_cnt(struct sk_buff
*buf
)
2773 return msg_reroute_cnt(buf_msg(buf
));
2776 static void incr_timer_cnt(struct sk_buff
*buf
)
2778 msg_incr_reroute_cnt(buf_msg(buf
));
2782 * tipc_link_recv_fragment(): Called with node lock on. Returns
2783 * the reassembled buffer if message is complete.
2785 int tipc_link_recv_fragment(struct sk_buff
**pending
, struct sk_buff
**fb
,
2786 struct tipc_msg
**m
)
2788 struct sk_buff
*prev
= NULL
;
2789 struct sk_buff
*fbuf
= *fb
;
2790 struct tipc_msg
*fragm
= buf_msg(fbuf
);
2791 struct sk_buff
*pbuf
= *pending
;
2792 u32 long_msg_seq_no
= msg_long_msgno(fragm
);
2795 msg_dbg(fragm
,"FRG<REC<");
2797 /* Is there an incomplete message waiting for this fragment? */
2799 while (pbuf
&& ((msg_seqno(buf_msg(pbuf
)) != long_msg_seq_no
)
2800 || (msg_orignode(fragm
) != msg_orignode(buf_msg(pbuf
))))) {
2805 if (!pbuf
&& (msg_type(fragm
) == FIRST_FRAGMENT
)) {
2806 struct tipc_msg
*imsg
= (struct tipc_msg
*)msg_data(fragm
);
2807 u32 msg_sz
= msg_size(imsg
);
2808 u32 fragm_sz
= msg_data_sz(fragm
);
2809 u32 exp_fragm_cnt
= msg_sz
/fragm_sz
+ !!(msg_sz
% fragm_sz
);
2810 u32 max
= TIPC_MAX_USER_MSG_SIZE
+ LONG_H_SIZE
;
2811 if (msg_type(imsg
) == TIPC_MCAST_MSG
)
2812 max
= TIPC_MAX_USER_MSG_SIZE
+ MCAST_H_SIZE
;
2813 if (msg_size(imsg
) > max
) {
2814 msg_dbg(fragm
,"<REC<Oversized: ");
2818 pbuf
= buf_acquire(msg_size(imsg
));
2820 pbuf
->next
= *pending
;
2822 skb_copy_to_linear_data(pbuf
, imsg
,
2823 msg_data_sz(fragm
));
2824 /* Prepare buffer for subsequent fragments. */
2826 set_long_msg_seqno(pbuf
, long_msg_seq_no
);
2827 set_fragm_size(pbuf
,fragm_sz
);
2828 set_expected_frags(pbuf
,exp_fragm_cnt
- 1);
2830 warn("Link unable to reassemble fragmented message\n");
2834 } else if (pbuf
&& (msg_type(fragm
) != FIRST_FRAGMENT
)) {
2835 u32 dsz
= msg_data_sz(fragm
);
2836 u32 fsz
= get_fragm_size(pbuf
);
2837 u32 crs
= ((msg_fragm_no(fragm
) - 1) * fsz
);
2838 u32 exp_frags
= get_expected_frags(pbuf
) - 1;
2839 skb_copy_to_linear_data_offset(pbuf
, crs
,
2840 msg_data(fragm
), dsz
);
2843 /* Is message complete? */
2845 if (exp_frags
== 0) {
2847 prev
->next
= pbuf
->next
;
2849 *pending
= pbuf
->next
;
2850 msg_reset_reroute_cnt(buf_msg(pbuf
));
2855 set_expected_frags(pbuf
,exp_frags
);
2858 dbg(" Discarding orphan fragment %x\n",fbuf
);
2859 msg_dbg(fragm
,"ORPHAN:");
2860 dbg("Pending long buffers:\n");
2861 dbg_print_buf_chain(*pending
);
2867 * link_check_defragm_bufs - flush stale incoming message fragments
2868 * @l_ptr: pointer to link
2871 static void link_check_defragm_bufs(struct link
*l_ptr
)
2873 struct sk_buff
*prev
= NULL
;
2874 struct sk_buff
*next
= NULL
;
2875 struct sk_buff
*buf
= l_ptr
->defragm_buf
;
2879 if (!link_working_working(l_ptr
))
2882 u32 cnt
= get_timer_cnt(buf
);
2886 incr_timer_cnt(buf
);
2889 dbg(" Discarding incomplete long buffer\n");
2890 msg_dbg(buf_msg(buf
), "LONG:");
2891 dbg_print_link(l_ptr
, "curr:");
2892 dbg("Pending long buffers:\n");
2893 dbg_print_buf_chain(l_ptr
->defragm_buf
);
2895 prev
->next
= buf
->next
;
2897 l_ptr
->defragm_buf
= buf
->next
;
2906 static void link_set_supervision_props(struct link
*l_ptr
, u32 tolerance
)
2908 l_ptr
->tolerance
= tolerance
;
2909 l_ptr
->continuity_interval
=
2910 ((tolerance
/ 4) > 500) ? 500 : tolerance
/ 4;
2911 l_ptr
->abort_limit
= tolerance
/ (l_ptr
->continuity_interval
/ 4);
2915 void tipc_link_set_queue_limits(struct link
*l_ptr
, u32 window
)
2917 /* Data messages from this node, inclusive FIRST_FRAGM */
2918 l_ptr
->queue_limit
[TIPC_LOW_IMPORTANCE
] = window
;
2919 l_ptr
->queue_limit
[TIPC_MEDIUM_IMPORTANCE
] = (window
/ 3) * 4;
2920 l_ptr
->queue_limit
[TIPC_HIGH_IMPORTANCE
] = (window
/ 3) * 5;
2921 l_ptr
->queue_limit
[TIPC_CRITICAL_IMPORTANCE
] = (window
/ 3) * 6;
2922 /* Transiting data messages,inclusive FIRST_FRAGM */
2923 l_ptr
->queue_limit
[TIPC_LOW_IMPORTANCE
+ 4] = 300;
2924 l_ptr
->queue_limit
[TIPC_MEDIUM_IMPORTANCE
+ 4] = 600;
2925 l_ptr
->queue_limit
[TIPC_HIGH_IMPORTANCE
+ 4] = 900;
2926 l_ptr
->queue_limit
[TIPC_CRITICAL_IMPORTANCE
+ 4] = 1200;
2927 l_ptr
->queue_limit
[CONN_MANAGER
] = 1200;
2928 l_ptr
->queue_limit
[ROUTE_DISTRIBUTOR
] = 1200;
2929 l_ptr
->queue_limit
[CHANGEOVER_PROTOCOL
] = 2500;
2930 l_ptr
->queue_limit
[NAME_DISTRIBUTOR
] = 3000;
2931 /* FRAGMENT and LAST_FRAGMENT packets */
2932 l_ptr
->queue_limit
[MSG_FRAGMENTER
] = 4000;
2936 * link_find_link - locate link by name
2937 * @name - ptr to link name string
2938 * @node - ptr to area to be filled with ptr to associated node
2940 * Caller must hold 'tipc_net_lock' to ensure node and bearer are not deleted;
2941 * this also prevents link deletion.
2943 * Returns pointer to link (or 0 if invalid link name).
2946 static struct link
*link_find_link(const char *name
, struct node
**node
)
2948 struct link_name link_name_parts
;
2949 struct bearer
*b_ptr
;
2952 if (!link_name_validate(name
, &link_name_parts
))
2955 b_ptr
= tipc_bearer_find_interface(link_name_parts
.if_local
);
2959 *node
= tipc_node_find(link_name_parts
.addr_peer
);
2963 l_ptr
= (*node
)->links
[b_ptr
->identity
];
2964 if (!l_ptr
|| strcmp(l_ptr
->name
, name
))
2970 struct sk_buff
*tipc_link_cmd_config(const void *req_tlv_area
, int req_tlv_space
,
2973 struct tipc_link_config
*args
;
2979 if (!TLV_CHECK(req_tlv_area
, req_tlv_space
, TIPC_TLV_LINK_CONFIG
))
2980 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR
);
2982 args
= (struct tipc_link_config
*)TLV_DATA(req_tlv_area
);
2983 new_value
= ntohl(args
->value
);
2985 if (!strcmp(args
->name
, tipc_bclink_name
)) {
2986 if ((cmd
== TIPC_CMD_SET_LINK_WINDOW
) &&
2987 (tipc_bclink_set_queue_limits(new_value
) == 0))
2988 return tipc_cfg_reply_none();
2989 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
2990 " (cannot change setting on broadcast link)");
2993 read_lock_bh(&tipc_net_lock
);
2994 l_ptr
= link_find_link(args
->name
, &node
);
2996 read_unlock_bh(&tipc_net_lock
);
2997 return tipc_cfg_reply_error_string("link not found");
3000 tipc_node_lock(node
);
3003 case TIPC_CMD_SET_LINK_TOL
:
3004 if ((new_value
>= TIPC_MIN_LINK_TOL
) &&
3005 (new_value
<= TIPC_MAX_LINK_TOL
)) {
3006 link_set_supervision_props(l_ptr
, new_value
);
3007 tipc_link_send_proto_msg(l_ptr
, STATE_MSG
,
3008 0, 0, new_value
, 0, 0);
3012 case TIPC_CMD_SET_LINK_PRI
:
3013 if ((new_value
>= TIPC_MIN_LINK_PRI
) &&
3014 (new_value
<= TIPC_MAX_LINK_PRI
)) {
3015 l_ptr
->priority
= new_value
;
3016 tipc_link_send_proto_msg(l_ptr
, STATE_MSG
,
3017 0, 0, 0, new_value
, 0);
3021 case TIPC_CMD_SET_LINK_WINDOW
:
3022 if ((new_value
>= TIPC_MIN_LINK_WIN
) &&
3023 (new_value
<= TIPC_MAX_LINK_WIN
)) {
3024 tipc_link_set_queue_limits(l_ptr
, new_value
);
3029 tipc_node_unlock(node
);
3031 read_unlock_bh(&tipc_net_lock
);
3033 return tipc_cfg_reply_error_string("cannot change link setting");
3035 return tipc_cfg_reply_none();
3039 * link_reset_statistics - reset link statistics
3040 * @l_ptr: pointer to link
3043 static void link_reset_statistics(struct link
*l_ptr
)
3045 memset(&l_ptr
->stats
, 0, sizeof(l_ptr
->stats
));
3046 l_ptr
->stats
.sent_info
= l_ptr
->next_out_no
;
3047 l_ptr
->stats
.recv_info
= l_ptr
->next_in_no
;
3050 struct sk_buff
*tipc_link_cmd_reset_stats(const void *req_tlv_area
, int req_tlv_space
)
3056 if (!TLV_CHECK(req_tlv_area
, req_tlv_space
, TIPC_TLV_LINK_NAME
))
3057 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR
);
3059 link_name
= (char *)TLV_DATA(req_tlv_area
);
3060 if (!strcmp(link_name
, tipc_bclink_name
)) {
3061 if (tipc_bclink_reset_stats())
3062 return tipc_cfg_reply_error_string("link not found");
3063 return tipc_cfg_reply_none();
3066 read_lock_bh(&tipc_net_lock
);
3067 l_ptr
= link_find_link(link_name
, &node
);
3069 read_unlock_bh(&tipc_net_lock
);
3070 return tipc_cfg_reply_error_string("link not found");
3073 tipc_node_lock(node
);
3074 link_reset_statistics(l_ptr
);
3075 tipc_node_unlock(node
);
3076 read_unlock_bh(&tipc_net_lock
);
3077 return tipc_cfg_reply_none();
3081 * percent - convert count to a percentage of total (rounding up or down)
3084 static u32
percent(u32 count
, u32 total
)
3086 return (count
* 100 + (total
/ 2)) / total
;
3090 * tipc_link_stats - print link statistics
3092 * @buf: print buffer area
3093 * @buf_size: size of print buffer area
3095 * Returns length of print buffer data string (or 0 if error)
3098 static int tipc_link_stats(const char *name
, char *buf
, const u32 buf_size
)
3100 struct print_buf pb
;
3104 u32 profile_total
= 0;
3106 if (!strcmp(name
, tipc_bclink_name
))
3107 return tipc_bclink_stats(buf
, buf_size
);
3109 tipc_printbuf_init(&pb
, buf
, buf_size
);
3111 read_lock_bh(&tipc_net_lock
);
3112 l_ptr
= link_find_link(name
, &node
);
3114 read_unlock_bh(&tipc_net_lock
);
3117 tipc_node_lock(node
);
3119 if (tipc_link_is_active(l_ptr
))
3121 else if (tipc_link_is_up(l_ptr
))
3125 tipc_printf(&pb
, "Link <%s>\n"
3126 " %s MTU:%u Priority:%u Tolerance:%u ms"
3127 " Window:%u packets\n",
3128 l_ptr
->name
, status
, link_max_pkt(l_ptr
),
3129 l_ptr
->priority
, l_ptr
->tolerance
, l_ptr
->queue_limit
[0]);
3130 tipc_printf(&pb
, " RX packets:%u fragments:%u/%u bundles:%u/%u\n",
3131 l_ptr
->next_in_no
- l_ptr
->stats
.recv_info
,
3132 l_ptr
->stats
.recv_fragments
,
3133 l_ptr
->stats
.recv_fragmented
,
3134 l_ptr
->stats
.recv_bundles
,
3135 l_ptr
->stats
.recv_bundled
);
3136 tipc_printf(&pb
, " TX packets:%u fragments:%u/%u bundles:%u/%u\n",
3137 l_ptr
->next_out_no
- l_ptr
->stats
.sent_info
,
3138 l_ptr
->stats
.sent_fragments
,
3139 l_ptr
->stats
.sent_fragmented
,
3140 l_ptr
->stats
.sent_bundles
,
3141 l_ptr
->stats
.sent_bundled
);
3142 profile_total
= l_ptr
->stats
.msg_length_counts
;
3145 tipc_printf(&pb
, " TX profile sample:%u packets average:%u octets\n"
3146 " 0-64:%u%% -256:%u%% -1024:%u%% -4096:%u%% "
3147 "-16354:%u%% -32768:%u%% -66000:%u%%\n",
3148 l_ptr
->stats
.msg_length_counts
,
3149 l_ptr
->stats
.msg_lengths_total
/ profile_total
,
3150 percent(l_ptr
->stats
.msg_length_profile
[0], profile_total
),
3151 percent(l_ptr
->stats
.msg_length_profile
[1], profile_total
),
3152 percent(l_ptr
->stats
.msg_length_profile
[2], profile_total
),
3153 percent(l_ptr
->stats
.msg_length_profile
[3], profile_total
),
3154 percent(l_ptr
->stats
.msg_length_profile
[4], profile_total
),
3155 percent(l_ptr
->stats
.msg_length_profile
[5], profile_total
),
3156 percent(l_ptr
->stats
.msg_length_profile
[6], profile_total
));
3157 tipc_printf(&pb
, " RX states:%u probes:%u naks:%u defs:%u dups:%u\n",
3158 l_ptr
->stats
.recv_states
,
3159 l_ptr
->stats
.recv_probes
,
3160 l_ptr
->stats
.recv_nacks
,
3161 l_ptr
->stats
.deferred_recv
,
3162 l_ptr
->stats
.duplicates
);
3163 tipc_printf(&pb
, " TX states:%u probes:%u naks:%u acks:%u dups:%u\n",
3164 l_ptr
->stats
.sent_states
,
3165 l_ptr
->stats
.sent_probes
,
3166 l_ptr
->stats
.sent_nacks
,
3167 l_ptr
->stats
.sent_acks
,
3168 l_ptr
->stats
.retransmitted
);
3169 tipc_printf(&pb
, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n",
3170 l_ptr
->stats
.bearer_congs
,
3171 l_ptr
->stats
.link_congs
,
3172 l_ptr
->stats
.max_queue_sz
,
3173 l_ptr
->stats
.queue_sz_counts
3174 ? (l_ptr
->stats
.accu_queue_sz
/ l_ptr
->stats
.queue_sz_counts
)
3177 tipc_node_unlock(node
);
3178 read_unlock_bh(&tipc_net_lock
);
3179 return tipc_printbuf_validate(&pb
);
3182 #define MAX_LINK_STATS_INFO 2000
3184 struct sk_buff
*tipc_link_cmd_show_stats(const void *req_tlv_area
, int req_tlv_space
)
3186 struct sk_buff
*buf
;
3187 struct tlv_desc
*rep_tlv
;
3190 if (!TLV_CHECK(req_tlv_area
, req_tlv_space
, TIPC_TLV_LINK_NAME
))
3191 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR
);
3193 buf
= tipc_cfg_reply_alloc(TLV_SPACE(MAX_LINK_STATS_INFO
));
3197 rep_tlv
= (struct tlv_desc
*)buf
->data
;
3199 str_len
= tipc_link_stats((char *)TLV_DATA(req_tlv_area
),
3200 (char *)TLV_DATA(rep_tlv
), MAX_LINK_STATS_INFO
);
3203 return tipc_cfg_reply_error_string("link not found");
3206 skb_put(buf
, TLV_SPACE(str_len
));
3207 TLV_SET(rep_tlv
, TIPC_TLV_ULTRA_STRING
, NULL
, str_len
);
3213 int link_control(const char *name
, u32 op
, u32 val
)
3221 a
= link_name2addr(name
, &bearer_id
);
3222 read_lock_bh(&tipc_net_lock
);
3223 node
= tipc_node_find(a
);
3225 tipc_node_lock(node
);
3226 l_ptr
= node
->links
[bearer_id
];
3228 if (op
== TIPC_REMOVE_LINK
) {
3229 struct bearer
*b_ptr
= l_ptr
->b_ptr
;
3230 spin_lock_bh(&b_ptr
->publ
.lock
);
3231 tipc_link_delete(l_ptr
);
3232 spin_unlock_bh(&b_ptr
->publ
.lock
);
3234 if (op
== TIPC_CMD_BLOCK_LINK
) {
3235 tipc_link_reset(l_ptr
);
3238 if (op
== TIPC_CMD_UNBLOCK_LINK
) {
3243 tipc_node_unlock(node
);
3245 read_unlock_bh(&tipc_net_lock
);
3251 * tipc_link_get_max_pkt - get maximum packet size to use when sending to destination
3252 * @dest: network address of destination node
3253 * @selector: used to select from set of active links
3255 * If no active link can be found, uses default maximum packet size.
3258 u32
tipc_link_get_max_pkt(u32 dest
, u32 selector
)
3262 u32 res
= MAX_PKT_DEFAULT
;
3264 if (dest
== tipc_own_addr
)
3265 return MAX_MSG_SIZE
;
3267 read_lock_bh(&tipc_net_lock
);
3268 n_ptr
= tipc_node_select(dest
, selector
);
3270 tipc_node_lock(n_ptr
);
3271 l_ptr
= n_ptr
->active_links
[selector
& 1];
3273 res
= link_max_pkt(l_ptr
);
3274 tipc_node_unlock(n_ptr
);
3276 read_unlock_bh(&tipc_net_lock
);
3281 static void link_dump_rec_queue(struct link
*l_ptr
)
3283 struct sk_buff
*crs
;
3285 if (!l_ptr
->oldest_deferred_in
) {
3286 info("Reception queue empty\n");
3289 info("Contents of Reception queue:\n");
3290 crs
= l_ptr
->oldest_deferred_in
;
3292 if (crs
->data
== (void *)0x0000a3a3) {
3293 info("buffer %x invalid\n", crs
);
3296 msg_dbg(buf_msg(crs
), "In rec queue: \n");
3302 static void link_dump_send_queue(struct link
*l_ptr
)
3304 if (l_ptr
->next_out
) {
3305 info("\nContents of unsent queue:\n");
3306 dbg_print_buf_chain(l_ptr
->next_out
);
3308 info("\nContents of send queue:\n");
3309 if (l_ptr
->first_out
) {
3310 dbg_print_buf_chain(l_ptr
->first_out
);
3312 info("Empty send queue\n");
3315 static void link_print(struct link
*l_ptr
, struct print_buf
*buf
,
3318 tipc_printf(buf
, str
);
3319 if (link_reset_reset(l_ptr
) || link_reset_unknown(l_ptr
))
3321 tipc_printf(buf
, "Link %x<%s>:",
3322 l_ptr
->addr
, l_ptr
->b_ptr
->publ
.name
);
3323 tipc_printf(buf
, ": NXO(%u):", mod(l_ptr
->next_out_no
));
3324 tipc_printf(buf
, "NXI(%u):", mod(l_ptr
->next_in_no
));
3325 tipc_printf(buf
, "SQUE");
3326 if (l_ptr
->first_out
) {
3327 tipc_printf(buf
, "[%u..", msg_seqno(buf_msg(l_ptr
->first_out
)));
3328 if (l_ptr
->next_out
)
3329 tipc_printf(buf
, "%u..",
3330 msg_seqno(buf_msg(l_ptr
->next_out
)));
3331 tipc_printf(buf
, "%u]",
3333 (l_ptr
->last_out
)), l_ptr
->out_queue_size
);
3334 if ((mod(msg_seqno(buf_msg(l_ptr
->last_out
)) -
3335 msg_seqno(buf_msg(l_ptr
->first_out
)))
3336 != (l_ptr
->out_queue_size
- 1))
3337 || (l_ptr
->last_out
->next
!= NULL
)) {
3338 tipc_printf(buf
, "\nSend queue inconsistency\n");
3339 tipc_printf(buf
, "first_out= %x ", l_ptr
->first_out
);
3340 tipc_printf(buf
, "next_out= %x ", l_ptr
->next_out
);
3341 tipc_printf(buf
, "last_out= %x ", l_ptr
->last_out
);
3342 link_dump_send_queue(l_ptr
);
3345 tipc_printf(buf
, "[]");
3346 tipc_printf(buf
, "SQSIZ(%u)", l_ptr
->out_queue_size
);
3347 if (l_ptr
->oldest_deferred_in
) {
3348 u32 o
= msg_seqno(buf_msg(l_ptr
->oldest_deferred_in
));
3349 u32 n
= msg_seqno(buf_msg(l_ptr
->newest_deferred_in
));
3350 tipc_printf(buf
, ":RQUE[%u..%u]", o
, n
);
3351 if (l_ptr
->deferred_inqueue_sz
!= mod((n
+ 1) - o
)) {
3352 tipc_printf(buf
, ":RQSIZ(%u)",
3353 l_ptr
->deferred_inqueue_sz
);
3356 if (link_working_unknown(l_ptr
))
3357 tipc_printf(buf
, ":WU");
3358 if (link_reset_reset(l_ptr
))
3359 tipc_printf(buf
, ":RR");
3360 if (link_reset_unknown(l_ptr
))
3361 tipc_printf(buf
, ":RU");
3362 if (link_working_working(l_ptr
))
3363 tipc_printf(buf
, ":WW");
3364 tipc_printf(buf
, "\n");