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 * Out-of-range value for link session numbers
57 #define INVALID_SESSION 0x10000
60 * Limit for deferred reception queue:
63 #define DEF_QUEUE_LIMIT 256u
69 #define STARTING_EVT 856384768 /* link processing trigger */
70 #define TRAFFIC_MSG_EVT 560815u /* rx'd ??? */
71 #define TIMEOUT_EVT 560817u /* link timer expired */
74 * The following two 'message types' is really just implementation
75 * data conveniently stored in the message header.
76 * They must not be considered part of the protocol
82 * State value stored in 'exp_msg_count'
85 #define START_CHANGEOVER 100000u
88 * struct link_name - deconstructed link name
89 * @addr_local: network address of node at this end
90 * @if_local: name of interface at this end
91 * @addr_peer: network address of node at far end
92 * @if_peer: name of interface at far end
97 char if_local[TIPC_MAX_IF_NAME];
99 char if_peer[TIPC_MAX_IF_NAME];
104 /* LINK EVENT CODE IS NOT SUPPORTED AT PRESENT */
107 * struct link_event - link up/down event notification
113 void (*fcn)(u32, char *, int);
114 char name[TIPC_MAX_LINK_NAME];
119 static void link_handle_out_of_seq_msg(struct link *l_ptr,
120 struct sk_buff *buf);
121 static void link_recv_proto_msg(struct link *l_ptr, struct sk_buff *buf);
122 static int link_recv_changeover_msg(struct link **l_ptr, struct sk_buff **buf);
123 static void link_set_supervision_props(struct link *l_ptr, u32 tolerance);
124 static int link_send_sections_long(struct port *sender,
125 struct iovec const *msg_sect,
126 u32 num_sect, u32 destnode);
127 static void link_check_defragm_bufs(struct link *l_ptr);
128 static void link_state_event(struct link *l_ptr, u32 event);
129 static void link_reset_statistics(struct link *l_ptr);
130 static void link_print(struct link *l_ptr, struct print_buf *buf,
134 * Debugging code used by link routines only
136 * When debugging link problems on a system that has multiple links,
137 * the standard TIPC debugging routines may not be useful since they
138 * allow the output from multiple links to be intermixed. For this reason
139 * routines of the form "dbg_link_XXX()" have been created that will capture
140 * debug info into a link's personal print buffer, which can then be dumped
141 * into the TIPC system log (TIPC_LOG) upon request.
143 * To enable per-link debugging, use LINK_LOG_BUF_SIZE to specify the size
144 * of the print buffer used by each link. If LINK_LOG_BUF_SIZE is set to 0,
145 * the dbg_link_XXX() routines simply send their output to the standard
146 * debug print buffer (DBG_OUTPUT), if it has been defined; this can be useful
147 * when there is only a single link in the system being debugged.
150 * - When enabled, LINK_LOG_BUF_SIZE should be set to at least TIPC_PB_MIN_SIZE
151 * - "l_ptr" must be valid when using dbg_link_XXX() macros
154 #define LINK_LOG_BUF_SIZE 0
156 #define dbg_link(fmt, arg...) \
158 if (LINK_LOG_BUF_SIZE) \
159 tipc_printf(&l_ptr->print_buf, fmt, ## arg); \
161 #define dbg_link_msg(msg, txt) \
163 if (LINK_LOG_BUF_SIZE) \
164 tipc_msg_dbg(&l_ptr->print_buf, msg, txt); \
166 #define dbg_link_state(txt) \
168 if (LINK_LOG_BUF_SIZE) \
169 link_print(l_ptr, &l_ptr->print_buf, txt); \
171 #define dbg_link_dump() do { \
172 if (LINK_LOG_BUF_SIZE) { \
173 tipc_printf(LOG, "\n\nDumping link <%s>:\n", l_ptr->name); \
174 tipc_printbuf_move(LOG, &l_ptr->print_buf); \
178 static void dbg_print_link(struct link *l_ptr, const char *str)
180 if (DBG_OUTPUT != TIPC_NULL)
181 link_print(l_ptr, DBG_OUTPUT, str);
184 static void dbg_print_buf_chain(struct sk_buff *root_buf)
186 if (DBG_OUTPUT != TIPC_NULL) {
187 struct sk_buff *buf = root_buf;
190 msg_dbg(buf_msg(buf), "In chain: ");
197 * Simple link routines
200 static unsigned int align(unsigned int i)
202 return (i + 3) & ~3u;
205 static int link_working_working(struct link *l_ptr)
207 return (l_ptr->state == WORKING_WORKING);
210 static int link_working_unknown(struct link *l_ptr)
212 return (l_ptr->state == WORKING_UNKNOWN);
215 static int link_reset_unknown(struct link *l_ptr)
217 return (l_ptr->state == RESET_UNKNOWN);
220 static int link_reset_reset(struct link *l_ptr)
222 return (l_ptr->state == RESET_RESET);
225 static int link_blocked(struct link *l_ptr)
227 return (l_ptr->exp_msg_count || l_ptr->blocked);
230 static int link_congested(struct link *l_ptr)
232 return (l_ptr->out_queue_size >= l_ptr->queue_limit[0]);
235 static u32 link_max_pkt(struct link *l_ptr)
237 return l_ptr->max_pkt;
240 static void link_init_max_pkt(struct link *l_ptr)
244 max_pkt = (l_ptr->b_ptr->publ.mtu & ~3);
245 if (max_pkt > MAX_MSG_SIZE)
246 max_pkt = MAX_MSG_SIZE;
248 l_ptr->max_pkt_target = max_pkt;
249 if (l_ptr->max_pkt_target < MAX_PKT_DEFAULT)
250 l_ptr->max_pkt = l_ptr->max_pkt_target;
252 l_ptr->max_pkt = MAX_PKT_DEFAULT;
254 l_ptr->max_pkt_probes = 0;
257 static u32 link_next_sent(struct link *l_ptr)
260 return msg_seqno(buf_msg(l_ptr->next_out));
261 return mod(l_ptr->next_out_no);
264 static u32 link_last_sent(struct link *l_ptr)
266 return mod(link_next_sent(l_ptr) - 1);
270 * Simple non-static link routines (i.e. referenced outside this file)
273 int tipc_link_is_up(struct link *l_ptr)
277 return (link_working_working(l_ptr) || link_working_unknown(l_ptr));
280 int tipc_link_is_active(struct link *l_ptr)
282 return ((l_ptr->owner->active_links[0] == l_ptr) ||
283 (l_ptr->owner->active_links[1] == l_ptr));
287 * link_name_validate - validate & (optionally) deconstruct link name
288 * @name - ptr to link name string
289 * @name_parts - ptr to area for link name components (or NULL if not needed)
291 * Returns 1 if link name is valid, otherwise 0.
294 static int link_name_validate(const char *name, struct link_name *name_parts)
296 char name_copy[TIPC_MAX_LINK_NAME];
302 u32 z_local, c_local, n_local;
303 u32 z_peer, c_peer, n_peer;
307 /* copy link name & ensure length is OK */
309 name_copy[TIPC_MAX_LINK_NAME - 1] = 0;
310 /* need above in case non-Posix strncpy() doesn't pad with nulls */
311 strncpy(name_copy, name, TIPC_MAX_LINK_NAME);
312 if (name_copy[TIPC_MAX_LINK_NAME - 1] != 0)
315 /* ensure all component parts of link name are present */
317 addr_local = name_copy;
318 if ((if_local = strchr(addr_local, ':')) == NULL)
321 if ((addr_peer = strchr(if_local, '-')) == NULL)
324 if_local_len = addr_peer - if_local;
325 if ((if_peer = strchr(addr_peer, ':')) == NULL)
328 if_peer_len = strlen(if_peer) + 1;
330 /* validate component parts of link name */
332 if ((sscanf(addr_local, "%u.%u.%u%c",
333 &z_local, &c_local, &n_local, &dummy) != 3) ||
334 (sscanf(addr_peer, "%u.%u.%u%c",
335 &z_peer, &c_peer, &n_peer, &dummy) != 3) ||
336 (z_local > 255) || (c_local > 4095) || (n_local > 4095) ||
337 (z_peer > 255) || (c_peer > 4095) || (n_peer > 4095) ||
338 (if_local_len <= 1) || (if_local_len > TIPC_MAX_IF_NAME) ||
339 (if_peer_len <= 1) || (if_peer_len > TIPC_MAX_IF_NAME) ||
340 (strspn(if_local, tipc_alphabet) != (if_local_len - 1)) ||
341 (strspn(if_peer, tipc_alphabet) != (if_peer_len - 1)))
344 /* return link name components, if necessary */
347 name_parts->addr_local = tipc_addr(z_local, c_local, n_local);
348 strcpy(name_parts->if_local, if_local);
349 name_parts->addr_peer = tipc_addr(z_peer, c_peer, n_peer);
350 strcpy(name_parts->if_peer, if_peer);
356 * link_timeout - handle expiration of link timer
357 * @l_ptr: pointer to link
359 * This routine must not grab "tipc_net_lock" to avoid a potential deadlock conflict
360 * with tipc_link_delete(). (There is no risk that the node will be deleted by
361 * another thread because tipc_link_delete() always cancels the link timer before
362 * tipc_node_delete() is called.)
365 static void link_timeout(struct link *l_ptr)
367 tipc_node_lock(l_ptr->owner);
369 /* update counters used in statistical profiling of send traffic */
371 l_ptr->stats.accu_queue_sz += l_ptr->out_queue_size;
372 l_ptr->stats.queue_sz_counts++;
374 if (l_ptr->out_queue_size > l_ptr->stats.max_queue_sz)
375 l_ptr->stats.max_queue_sz = l_ptr->out_queue_size;
377 if (l_ptr->first_out) {
378 struct tipc_msg *msg = buf_msg(l_ptr->first_out);
379 u32 length = msg_size(msg);
381 if ((msg_user(msg) == MSG_FRAGMENTER) &&
382 (msg_type(msg) == FIRST_FRAGMENT)) {
383 length = msg_size(msg_get_wrapped(msg));
386 l_ptr->stats.msg_lengths_total += length;
387 l_ptr->stats.msg_length_counts++;
389 l_ptr->stats.msg_length_profile[0]++;
390 else if (length <= 256)
391 l_ptr->stats.msg_length_profile[1]++;
392 else if (length <= 1024)
393 l_ptr->stats.msg_length_profile[2]++;
394 else if (length <= 4096)
395 l_ptr->stats.msg_length_profile[3]++;
396 else if (length <= 16384)
397 l_ptr->stats.msg_length_profile[4]++;
398 else if (length <= 32768)
399 l_ptr->stats.msg_length_profile[5]++;
401 l_ptr->stats.msg_length_profile[6]++;
405 /* do all other link processing performed on a periodic basis */
407 link_check_defragm_bufs(l_ptr);
409 link_state_event(l_ptr, TIMEOUT_EVT);
412 tipc_link_push_queue(l_ptr);
414 tipc_node_unlock(l_ptr->owner);
417 static void link_set_timer(struct link *l_ptr, u32 time)
419 k_start_timer(&l_ptr->timer, time);
423 * tipc_link_create - create a new link
424 * @b_ptr: pointer to associated bearer
425 * @peer: network address of node at other end of link
426 * @media_addr: media address to use when sending messages over link
428 * Returns pointer to link.
431 struct link *tipc_link_create(struct bearer *b_ptr, const u32 peer,
432 const struct tipc_media_addr *media_addr)
435 struct tipc_msg *msg;
438 l_ptr = kzalloc(sizeof(*l_ptr), GFP_ATOMIC);
440 warn("Link creation failed, no memory\n");
444 if (LINK_LOG_BUF_SIZE) {
445 char *pb = kmalloc(LINK_LOG_BUF_SIZE, GFP_ATOMIC);
449 warn("Link creation failed, no memory for print buffer\n");
452 tipc_printbuf_init(&l_ptr->print_buf, pb, LINK_LOG_BUF_SIZE);
456 if_name = strchr(b_ptr->publ.name, ':') + 1;
457 sprintf(l_ptr->name, "%u.%u.%u:%s-%u.%u.%u:",
458 tipc_zone(tipc_own_addr), tipc_cluster(tipc_own_addr),
459 tipc_node(tipc_own_addr),
461 tipc_zone(peer), tipc_cluster(peer), tipc_node(peer));
462 /* note: peer i/f is appended to link name by reset/activate */
463 memcpy(&l_ptr->media_addr, media_addr, sizeof(*media_addr));
464 l_ptr->checkpoint = 1;
465 l_ptr->b_ptr = b_ptr;
466 link_set_supervision_props(l_ptr, b_ptr->media->tolerance);
467 l_ptr->state = RESET_UNKNOWN;
469 l_ptr->pmsg = (struct tipc_msg *)&l_ptr->proto_msg;
471 msg_init(msg, LINK_PROTOCOL, RESET_MSG, INT_H_SIZE, l_ptr->addr);
472 msg_set_size(msg, sizeof(l_ptr->proto_msg));
473 msg_set_session(msg, (tipc_random & 0xffff));
474 msg_set_bearer_id(msg, b_ptr->identity);
475 strcpy((char *)msg_data(msg), if_name);
477 l_ptr->priority = b_ptr->priority;
478 tipc_link_set_queue_limits(l_ptr, b_ptr->media->window);
480 link_init_max_pkt(l_ptr);
482 l_ptr->next_out_no = 1;
483 INIT_LIST_HEAD(&l_ptr->waiting_ports);
485 link_reset_statistics(l_ptr);
487 l_ptr->owner = tipc_node_attach_link(l_ptr);
489 if (LINK_LOG_BUF_SIZE)
490 kfree(l_ptr->print_buf.buf);
495 k_init_timer(&l_ptr->timer, (Handler)link_timeout, (unsigned long)l_ptr);
496 list_add_tail(&l_ptr->link_list, &b_ptr->links);
497 tipc_k_signal((Handler)tipc_link_start, (unsigned long)l_ptr);
499 dbg("tipc_link_create(): tolerance = %u,cont intv = %u, abort_limit = %u\n",
500 l_ptr->tolerance, l_ptr->continuity_interval, l_ptr->abort_limit);
506 * tipc_link_delete - delete a link
507 * @l_ptr: pointer to link
509 * Note: 'tipc_net_lock' is write_locked, bearer is locked.
510 * This routine must not grab the node lock until after link timer cancellation
511 * to avoid a potential deadlock situation.
514 void tipc_link_delete(struct link *l_ptr)
517 err("Attempt to delete non-existent link\n");
521 dbg("tipc_link_delete()\n");
523 k_cancel_timer(&l_ptr->timer);
525 tipc_node_lock(l_ptr->owner);
526 tipc_link_reset(l_ptr);
527 tipc_node_detach_link(l_ptr->owner, l_ptr);
528 tipc_link_stop(l_ptr);
529 list_del_init(&l_ptr->link_list);
530 if (LINK_LOG_BUF_SIZE)
531 kfree(l_ptr->print_buf.buf);
532 tipc_node_unlock(l_ptr->owner);
533 k_term_timer(&l_ptr->timer);
537 void tipc_link_start(struct link *l_ptr)
539 dbg("tipc_link_start %x\n", l_ptr);
540 link_state_event(l_ptr, STARTING_EVT);
544 * link_schedule_port - schedule port for deferred sending
545 * @l_ptr: pointer to link
546 * @origport: reference to sending port
547 * @sz: amount of data to be sent
549 * Schedules port for renewed sending of messages after link congestion
553 static int link_schedule_port(struct link *l_ptr, u32 origport, u32 sz)
557 spin_lock_bh(&tipc_port_list_lock);
558 p_ptr = tipc_port_lock(origport);
562 if (!list_empty(&p_ptr->wait_list))
564 p_ptr->congested_link = l_ptr;
565 p_ptr->publ.congested = 1;
566 p_ptr->waiting_pkts = 1 + ((sz - 1) / link_max_pkt(l_ptr));
567 list_add_tail(&p_ptr->wait_list, &l_ptr->waiting_ports);
568 l_ptr->stats.link_congs++;
570 tipc_port_unlock(p_ptr);
572 spin_unlock_bh(&tipc_port_list_lock);
576 void tipc_link_wakeup_ports(struct link *l_ptr, int all)
579 struct port *temp_p_ptr;
580 int win = l_ptr->queue_limit[0] - l_ptr->out_queue_size;
586 if (!spin_trylock_bh(&tipc_port_list_lock))
588 if (link_congested(l_ptr))
590 list_for_each_entry_safe(p_ptr, temp_p_ptr, &l_ptr->waiting_ports,
594 list_del_init(&p_ptr->wait_list);
595 p_ptr->congested_link = NULL;
596 spin_lock_bh(p_ptr->publ.lock);
597 p_ptr->publ.congested = 0;
598 p_ptr->wakeup(&p_ptr->publ);
599 win -= p_ptr->waiting_pkts;
600 spin_unlock_bh(p_ptr->publ.lock);
604 spin_unlock_bh(&tipc_port_list_lock);
608 * link_release_outqueue - purge link's outbound message queue
609 * @l_ptr: pointer to link
612 static void link_release_outqueue(struct link *l_ptr)
614 struct sk_buff *buf = l_ptr->first_out;
615 struct sk_buff *next;
622 l_ptr->first_out = NULL;
623 l_ptr->out_queue_size = 0;
627 * tipc_link_reset_fragments - purge link's inbound message fragments queue
628 * @l_ptr: pointer to link
631 void tipc_link_reset_fragments(struct link *l_ptr)
633 struct sk_buff *buf = l_ptr->defragm_buf;
634 struct sk_buff *next;
641 l_ptr->defragm_buf = NULL;
645 * tipc_link_stop - purge all inbound and outbound messages associated with link
646 * @l_ptr: pointer to link
649 void tipc_link_stop(struct link *l_ptr)
652 struct sk_buff *next;
654 buf = l_ptr->oldest_deferred_in;
661 buf = l_ptr->first_out;
668 tipc_link_reset_fragments(l_ptr);
670 buf_discard(l_ptr->proto_msg_queue);
671 l_ptr->proto_msg_queue = NULL;
676 /* LINK EVENT CODE IS NOT SUPPORTED AT PRESENT */
678 static void link_recv_event(struct link_event *ev)
680 ev->fcn(ev->addr, ev->name, ev->up);
684 static void link_send_event(void (*fcn)(u32 a, char *n, int up),
685 struct link *l_ptr, int up)
687 struct link_event *ev;
689 ev = kmalloc(sizeof(*ev), GFP_ATOMIC);
691 warn("Link event allocation failure\n");
694 ev->addr = l_ptr->addr;
697 memcpy(ev->name, l_ptr->name, TIPC_MAX_LINK_NAME);
698 tipc_k_signal((Handler)link_recv_event, (unsigned long)ev);
703 #define link_send_event(fcn, l_ptr, up) do { } while (0)
707 void tipc_link_reset(struct link *l_ptr)
710 u32 prev_state = l_ptr->state;
711 u32 checkpoint = l_ptr->next_in_no;
712 int was_active_link = tipc_link_is_active(l_ptr);
714 msg_set_session(l_ptr->pmsg, ((msg_session(l_ptr->pmsg) + 1) & 0xffff));
716 /* Link is down, accept any session */
717 l_ptr->peer_session = INVALID_SESSION;
719 /* Prepare for max packet size negotiation */
720 link_init_max_pkt(l_ptr);
722 l_ptr->state = RESET_UNKNOWN;
723 dbg_link_state("Resetting Link\n");
725 if ((prev_state == RESET_UNKNOWN) || (prev_state == RESET_RESET))
728 tipc_node_link_down(l_ptr->owner, l_ptr);
729 tipc_bearer_remove_dest(l_ptr->b_ptr, l_ptr->addr);
731 tipc_printf(TIPC_CONS, "\nReset link <%s>\n", l_ptr->name);
734 if (was_active_link && tipc_node_has_active_links(l_ptr->owner) &&
735 l_ptr->owner->permit_changeover) {
736 l_ptr->reset_checkpoint = checkpoint;
737 l_ptr->exp_msg_count = START_CHANGEOVER;
740 /* Clean up all queues: */
742 link_release_outqueue(l_ptr);
743 buf_discard(l_ptr->proto_msg_queue);
744 l_ptr->proto_msg_queue = NULL;
745 buf = l_ptr->oldest_deferred_in;
747 struct sk_buff *next = buf->next;
751 if (!list_empty(&l_ptr->waiting_ports))
752 tipc_link_wakeup_ports(l_ptr, 1);
754 l_ptr->retransm_queue_head = 0;
755 l_ptr->retransm_queue_size = 0;
756 l_ptr->last_out = NULL;
757 l_ptr->first_out = NULL;
758 l_ptr->next_out = NULL;
759 l_ptr->unacked_window = 0;
760 l_ptr->checkpoint = 1;
761 l_ptr->next_out_no = 1;
762 l_ptr->deferred_inqueue_sz = 0;
763 l_ptr->oldest_deferred_in = NULL;
764 l_ptr->newest_deferred_in = NULL;
765 l_ptr->fsm_msg_cnt = 0;
766 l_ptr->stale_count = 0;
767 link_reset_statistics(l_ptr);
769 link_send_event(tipc_cfg_link_event, l_ptr, 0);
770 if (!in_own_cluster(l_ptr->addr))
771 link_send_event(tipc_disc_link_event, l_ptr, 0);
775 static void link_activate(struct link *l_ptr)
777 l_ptr->next_in_no = l_ptr->stats.recv_info = 1;
778 tipc_node_link_up(l_ptr->owner, l_ptr);
779 tipc_bearer_add_dest(l_ptr->b_ptr, l_ptr->addr);
780 link_send_event(tipc_cfg_link_event, l_ptr, 1);
781 if (!in_own_cluster(l_ptr->addr))
782 link_send_event(tipc_disc_link_event, l_ptr, 1);
786 * link_state_event - link finite state machine
787 * @l_ptr: pointer to link
788 * @event: state machine event to process
791 static void link_state_event(struct link *l_ptr, unsigned event)
794 u32 cont_intv = l_ptr->continuity_interval;
796 if (!l_ptr->started && (event != STARTING_EVT))
797 return; /* Not yet. */
799 if (link_blocked(l_ptr)) {
800 if (event == TIMEOUT_EVT) {
801 link_set_timer(l_ptr, cont_intv);
803 return; /* Changeover going on */
805 dbg_link("STATE_EV: <%s> ", l_ptr->name);
807 switch (l_ptr->state) {
808 case WORKING_WORKING:
811 case TRAFFIC_MSG_EVT:
819 if (l_ptr->next_in_no != l_ptr->checkpoint) {
820 l_ptr->checkpoint = l_ptr->next_in_no;
821 if (tipc_bclink_acks_missing(l_ptr->owner)) {
822 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
824 l_ptr->fsm_msg_cnt++;
825 } else if (l_ptr->max_pkt < l_ptr->max_pkt_target) {
826 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
828 l_ptr->fsm_msg_cnt++;
830 link_set_timer(l_ptr, cont_intv);
833 dbg_link(" -> WU\n");
834 l_ptr->state = WORKING_UNKNOWN;
835 l_ptr->fsm_msg_cnt = 0;
836 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 1, 0, 0, 0, 0);
837 l_ptr->fsm_msg_cnt++;
838 link_set_timer(l_ptr, cont_intv / 4);
841 dbg_link("RES -> RR\n");
842 info("Resetting link <%s>, requested by peer\n",
844 tipc_link_reset(l_ptr);
845 l_ptr->state = RESET_RESET;
846 l_ptr->fsm_msg_cnt = 0;
847 tipc_link_send_proto_msg(l_ptr, ACTIVATE_MSG, 0, 0, 0, 0, 0);
848 l_ptr->fsm_msg_cnt++;
849 link_set_timer(l_ptr, cont_intv);
852 err("Unknown link event %u in WW state\n", event);
855 case WORKING_UNKNOWN:
858 case TRAFFIC_MSG_EVT:
861 dbg_link("ACT -> WW\n");
862 l_ptr->state = WORKING_WORKING;
863 l_ptr->fsm_msg_cnt = 0;
864 link_set_timer(l_ptr, cont_intv);
867 dbg_link("RES -> RR\n");
868 info("Resetting link <%s>, requested by peer "
869 "while probing\n", l_ptr->name);
870 tipc_link_reset(l_ptr);
871 l_ptr->state = RESET_RESET;
872 l_ptr->fsm_msg_cnt = 0;
873 tipc_link_send_proto_msg(l_ptr, ACTIVATE_MSG, 0, 0, 0, 0, 0);
874 l_ptr->fsm_msg_cnt++;
875 link_set_timer(l_ptr, cont_intv);
879 if (l_ptr->next_in_no != l_ptr->checkpoint) {
881 l_ptr->state = WORKING_WORKING;
882 l_ptr->fsm_msg_cnt = 0;
883 l_ptr->checkpoint = l_ptr->next_in_no;
884 if (tipc_bclink_acks_missing(l_ptr->owner)) {
885 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
887 l_ptr->fsm_msg_cnt++;
889 link_set_timer(l_ptr, cont_intv);
890 } else if (l_ptr->fsm_msg_cnt < l_ptr->abort_limit) {
891 dbg_link("Probing %u/%u,timer = %u ms)\n",
892 l_ptr->fsm_msg_cnt, l_ptr->abort_limit,
894 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
896 l_ptr->fsm_msg_cnt++;
897 link_set_timer(l_ptr, cont_intv / 4);
898 } else { /* Link has failed */
899 dbg_link("-> RU (%u probes unanswered)\n",
901 warn("Resetting link <%s>, peer not responding\n",
903 tipc_link_reset(l_ptr);
904 l_ptr->state = RESET_UNKNOWN;
905 l_ptr->fsm_msg_cnt = 0;
906 tipc_link_send_proto_msg(l_ptr, RESET_MSG,
908 l_ptr->fsm_msg_cnt++;
909 link_set_timer(l_ptr, cont_intv);
913 err("Unknown link event %u in WU state\n", event);
919 case TRAFFIC_MSG_EVT:
923 other = l_ptr->owner->active_links[0];
924 if (other && link_working_unknown(other)) {
928 dbg_link("ACT -> WW\n");
929 l_ptr->state = WORKING_WORKING;
930 l_ptr->fsm_msg_cnt = 0;
931 link_activate(l_ptr);
932 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 1, 0, 0, 0, 0);
933 l_ptr->fsm_msg_cnt++;
934 link_set_timer(l_ptr, cont_intv);
938 dbg_link(" -> RR\n");
939 l_ptr->state = RESET_RESET;
940 l_ptr->fsm_msg_cnt = 0;
941 tipc_link_send_proto_msg(l_ptr, ACTIVATE_MSG, 1, 0, 0, 0, 0);
942 l_ptr->fsm_msg_cnt++;
943 link_set_timer(l_ptr, cont_intv);
951 tipc_link_send_proto_msg(l_ptr, RESET_MSG, 0, 0, 0, 0, 0);
952 l_ptr->fsm_msg_cnt++;
953 link_set_timer(l_ptr, cont_intv);
956 err("Unknown link event %u in RU state\n", event);
962 case TRAFFIC_MSG_EVT:
966 other = l_ptr->owner->active_links[0];
967 if (other && link_working_unknown(other)) {
971 dbg_link("ACT -> WW\n");
972 l_ptr->state = WORKING_WORKING;
973 l_ptr->fsm_msg_cnt = 0;
974 link_activate(l_ptr);
975 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 1, 0, 0, 0, 0);
976 l_ptr->fsm_msg_cnt++;
977 link_set_timer(l_ptr, cont_intv);
984 tipc_link_send_proto_msg(l_ptr, ACTIVATE_MSG, 0, 0, 0, 0, 0);
985 l_ptr->fsm_msg_cnt++;
986 link_set_timer(l_ptr, cont_intv);
987 dbg_link("fsm_msg_cnt %u\n", l_ptr->fsm_msg_cnt);
990 err("Unknown link event %u in RR state\n", event);
994 err("Unknown link state %u/%u\n", l_ptr->state, event);
999 * link_bundle_buf(): Append contents of a buffer to
1000 * the tail of an existing one.
1003 static int link_bundle_buf(struct link *l_ptr,
1004 struct sk_buff *bundler,
1005 struct sk_buff *buf)
1007 struct tipc_msg *bundler_msg = buf_msg(bundler);
1008 struct tipc_msg *msg = buf_msg(buf);
1009 u32 size = msg_size(msg);
1010 u32 bundle_size = msg_size(bundler_msg);
1011 u32 to_pos = align(bundle_size);
1012 u32 pad = to_pos - bundle_size;
1014 if (msg_user(bundler_msg) != MSG_BUNDLER)
1016 if (msg_type(bundler_msg) != OPEN_MSG)
1018 if (skb_tailroom(bundler) < (pad + size))
1020 if (link_max_pkt(l_ptr) < (to_pos + size))
1023 skb_put(bundler, pad + size);
1024 skb_copy_to_linear_data_offset(bundler, to_pos, buf->data, size);
1025 msg_set_size(bundler_msg, to_pos + size);
1026 msg_set_msgcnt(bundler_msg, msg_msgcnt(bundler_msg) + 1);
1027 dbg("Packed msg # %u(%u octets) into pos %u in buf(#%u)\n",
1028 msg_msgcnt(bundler_msg), size, to_pos, msg_seqno(bundler_msg));
1029 msg_dbg(msg, "PACKD:");
1031 l_ptr->stats.sent_bundled++;
1035 static void link_add_to_outqueue(struct link *l_ptr,
1036 struct sk_buff *buf,
1037 struct tipc_msg *msg)
1039 u32 ack = mod(l_ptr->next_in_no - 1);
1040 u32 seqno = mod(l_ptr->next_out_no++);
1042 msg_set_word(msg, 2, ((ack << 16) | seqno));
1043 msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in);
1045 if (l_ptr->first_out) {
1046 l_ptr->last_out->next = buf;
1047 l_ptr->last_out = buf;
1049 l_ptr->first_out = l_ptr->last_out = buf;
1050 l_ptr->out_queue_size++;
1054 * tipc_link_send_buf() is the 'full path' for messages, called from
1055 * inside TIPC when the 'fast path' in tipc_send_buf
1056 * has failed, and from link_send()
1059 int tipc_link_send_buf(struct link *l_ptr, struct sk_buff *buf)
1061 struct tipc_msg *msg = buf_msg(buf);
1062 u32 size = msg_size(msg);
1063 u32 dsz = msg_data_sz(msg);
1064 u32 queue_size = l_ptr->out_queue_size;
1065 u32 imp = msg_tot_importance(msg);
1066 u32 queue_limit = l_ptr->queue_limit[imp];
1067 u32 max_packet = link_max_pkt(l_ptr);
1069 msg_set_prevnode(msg, tipc_own_addr); /* If routed message */
1071 /* Match msg importance against queue limits: */
1073 if (unlikely(queue_size >= queue_limit)) {
1074 if (imp <= TIPC_CRITICAL_IMPORTANCE) {
1075 return link_schedule_port(l_ptr, msg_origport(msg),
1078 msg_dbg(msg, "TIPC: Congestion, throwing away\n");
1080 if (imp > CONN_MANAGER) {
1081 warn("Resetting link <%s>, send queue full", l_ptr->name);
1082 tipc_link_reset(l_ptr);
1087 /* Fragmentation needed ? */
1089 if (size > max_packet)
1090 return tipc_link_send_long_buf(l_ptr, buf);
1092 /* Packet can be queued or sent: */
1094 if (queue_size > l_ptr->stats.max_queue_sz)
1095 l_ptr->stats.max_queue_sz = queue_size;
1097 if (likely(!tipc_bearer_congested(l_ptr->b_ptr, l_ptr) &&
1098 !link_congested(l_ptr))) {
1099 link_add_to_outqueue(l_ptr, buf, msg);
1101 if (likely(tipc_bearer_send(l_ptr->b_ptr, buf, &l_ptr->media_addr))) {
1102 l_ptr->unacked_window = 0;
1104 tipc_bearer_schedule(l_ptr->b_ptr, l_ptr);
1105 l_ptr->stats.bearer_congs++;
1106 l_ptr->next_out = buf;
1110 /* Congestion: can message be bundled ?: */
1112 if ((msg_user(msg) != CHANGEOVER_PROTOCOL) &&
1113 (msg_user(msg) != MSG_FRAGMENTER)) {
1115 /* Try adding message to an existing bundle */
1117 if (l_ptr->next_out &&
1118 link_bundle_buf(l_ptr, l_ptr->last_out, buf)) {
1119 tipc_bearer_resolve_congestion(l_ptr->b_ptr, l_ptr);
1123 /* Try creating a new bundle */
1125 if (size <= max_packet * 2 / 3) {
1126 struct sk_buff *bundler = buf_acquire(max_packet);
1127 struct tipc_msg bundler_hdr;
1130 msg_init(&bundler_hdr, MSG_BUNDLER, OPEN_MSG,
1131 INT_H_SIZE, l_ptr->addr);
1132 skb_copy_to_linear_data(bundler, &bundler_hdr,
1134 skb_trim(bundler, INT_H_SIZE);
1135 link_bundle_buf(l_ptr, bundler, buf);
1138 l_ptr->stats.sent_bundles++;
1142 if (!l_ptr->next_out)
1143 l_ptr->next_out = buf;
1144 link_add_to_outqueue(l_ptr, buf, msg);
1145 tipc_bearer_resolve_congestion(l_ptr->b_ptr, l_ptr);
1150 * tipc_link_send(): same as tipc_link_send_buf(), but the link to use has
1151 * not been selected yet, and the the owner node is not locked
1152 * Called by TIPC internal users, e.g. the name distributor
1155 int tipc_link_send(struct sk_buff *buf, u32 dest, u32 selector)
1158 struct tipc_node *n_ptr;
1159 int res = -ELINKCONG;
1161 read_lock_bh(&tipc_net_lock);
1162 n_ptr = tipc_node_select(dest, selector);
1164 tipc_node_lock(n_ptr);
1165 l_ptr = n_ptr->active_links[selector & 1];
1167 dbg("tipc_link_send: found link %x for dest %x\n", l_ptr, dest);
1168 res = tipc_link_send_buf(l_ptr, buf);
1170 dbg("Attempt to send msg to unreachable node:\n");
1171 msg_dbg(buf_msg(buf),">>>");
1174 tipc_node_unlock(n_ptr);
1176 dbg("Attempt to send msg to unknown node:\n");
1177 msg_dbg(buf_msg(buf),">>>");
1180 read_unlock_bh(&tipc_net_lock);
1185 * link_send_buf_fast: Entry for data messages where the
1186 * destination link is known and the header is complete,
1187 * inclusive total message length. Very time critical.
1188 * Link is locked. Returns user data length.
1191 static int link_send_buf_fast(struct link *l_ptr, struct sk_buff *buf,
1194 struct tipc_msg *msg = buf_msg(buf);
1195 int res = msg_data_sz(msg);
1197 if (likely(!link_congested(l_ptr))) {
1198 if (likely(msg_size(msg) <= link_max_pkt(l_ptr))) {
1199 if (likely(list_empty(&l_ptr->b_ptr->cong_links))) {
1200 link_add_to_outqueue(l_ptr, buf, msg);
1201 if (likely(tipc_bearer_send(l_ptr->b_ptr, buf,
1202 &l_ptr->media_addr))) {
1203 l_ptr->unacked_window = 0;
1204 msg_dbg(msg,"SENT_FAST:");
1207 dbg("failed sent fast...\n");
1208 tipc_bearer_schedule(l_ptr->b_ptr, l_ptr);
1209 l_ptr->stats.bearer_congs++;
1210 l_ptr->next_out = buf;
1215 *used_max_pkt = link_max_pkt(l_ptr);
1217 return tipc_link_send_buf(l_ptr, buf); /* All other cases */
1221 * tipc_send_buf_fast: Entry for data messages where the
1222 * destination node is known and the header is complete,
1223 * inclusive total message length.
1224 * Returns user data length.
1226 int tipc_send_buf_fast(struct sk_buff *buf, u32 destnode)
1229 struct tipc_node *n_ptr;
1231 u32 selector = msg_origport(buf_msg(buf)) & 1;
1234 if (destnode == tipc_own_addr)
1235 return tipc_port_recv_msg(buf);
1237 read_lock_bh(&tipc_net_lock);
1238 n_ptr = tipc_node_select(destnode, selector);
1239 if (likely(n_ptr)) {
1240 tipc_node_lock(n_ptr);
1241 l_ptr = n_ptr->active_links[selector];
1242 dbg("send_fast: buf %x selected %x, destnode = %x\n",
1243 buf, l_ptr, destnode);
1244 if (likely(l_ptr)) {
1245 res = link_send_buf_fast(l_ptr, buf, &dummy);
1246 tipc_node_unlock(n_ptr);
1247 read_unlock_bh(&tipc_net_lock);
1250 tipc_node_unlock(n_ptr);
1252 read_unlock_bh(&tipc_net_lock);
1253 res = msg_data_sz(buf_msg(buf));
1254 tipc_reject_msg(buf, TIPC_ERR_NO_NODE);
1260 * tipc_link_send_sections_fast: Entry for messages where the
1261 * destination processor is known and the header is complete,
1262 * except for total message length.
1263 * Returns user data length or errno.
1265 int tipc_link_send_sections_fast(struct port *sender,
1266 struct iovec const *msg_sect,
1270 struct tipc_msg *hdr = &sender->publ.phdr;
1272 struct sk_buff *buf;
1273 struct tipc_node *node;
1275 u32 selector = msg_origport(hdr) & 1;
1279 * Try building message using port's max_pkt hint.
1280 * (Must not hold any locks while building message.)
1283 res = msg_build(hdr, msg_sect, num_sect, sender->publ.max_pkt,
1284 !sender->user_port, &buf);
1286 read_lock_bh(&tipc_net_lock);
1287 node = tipc_node_select(destaddr, selector);
1289 tipc_node_lock(node);
1290 l_ptr = node->active_links[selector];
1291 if (likely(l_ptr)) {
1293 res = link_send_buf_fast(l_ptr, buf,
1294 &sender->publ.max_pkt);
1295 if (unlikely(res < 0))
1298 tipc_node_unlock(node);
1299 read_unlock_bh(&tipc_net_lock);
1303 /* Exit if build request was invalid */
1305 if (unlikely(res < 0))
1308 /* Exit if link (or bearer) is congested */
1310 if (link_congested(l_ptr) ||
1311 !list_empty(&l_ptr->b_ptr->cong_links)) {
1312 res = link_schedule_port(l_ptr,
1313 sender->publ.ref, res);
1318 * Message size exceeds max_pkt hint; update hint,
1319 * then re-try fast path or fragment the message
1322 sender->publ.max_pkt = link_max_pkt(l_ptr);
1323 tipc_node_unlock(node);
1324 read_unlock_bh(&tipc_net_lock);
1327 if ((msg_hdr_sz(hdr) + res) <= sender->publ.max_pkt)
1330 return link_send_sections_long(sender, msg_sect,
1331 num_sect, destaddr);
1333 tipc_node_unlock(node);
1335 read_unlock_bh(&tipc_net_lock);
1337 /* Couldn't find a link to the destination node */
1340 return tipc_reject_msg(buf, TIPC_ERR_NO_NODE);
1342 return tipc_port_reject_sections(sender, hdr, msg_sect, num_sect,
1348 * link_send_sections_long(): Entry for long messages where the
1349 * destination node is known and the header is complete,
1350 * inclusive total message length.
1351 * Link and bearer congestion status have been checked to be ok,
1352 * and are ignored if they change.
1354 * Note that fragments do not use the full link MTU so that they won't have
1355 * to undergo refragmentation if link changeover causes them to be sent
1356 * over another link with an additional tunnel header added as prefix.
1357 * (Refragmentation will still occur if the other link has a smaller MTU.)
1359 * Returns user data length or errno.
1361 static int link_send_sections_long(struct port *sender,
1362 struct iovec const *msg_sect,
1367 struct tipc_node *node;
1368 struct tipc_msg *hdr = &sender->publ.phdr;
1369 u32 dsz = msg_data_sz(hdr);
1370 u32 max_pkt,fragm_sz,rest;
1371 struct tipc_msg fragm_hdr;
1372 struct sk_buff *buf,*buf_chain,*prev;
1373 u32 fragm_crs,fragm_rest,hsz,sect_rest;
1374 const unchar *sect_crs;
1380 max_pkt = sender->publ.max_pkt - INT_H_SIZE;
1381 /* leave room for tunnel header in case of link changeover */
1382 fragm_sz = max_pkt - INT_H_SIZE;
1383 /* leave room for fragmentation header in each fragment */
1391 /* Prepare reusable fragment header: */
1393 msg_dbg(hdr, ">FRAGMENTING>");
1394 msg_init(&fragm_hdr, MSG_FRAGMENTER, FIRST_FRAGMENT,
1395 INT_H_SIZE, msg_destnode(hdr));
1396 msg_set_link_selector(&fragm_hdr, sender->publ.ref);
1397 msg_set_size(&fragm_hdr, max_pkt);
1398 msg_set_fragm_no(&fragm_hdr, 1);
1400 /* Prepare header of first fragment: */
1402 buf_chain = buf = buf_acquire(max_pkt);
1406 skb_copy_to_linear_data(buf, &fragm_hdr, INT_H_SIZE);
1407 hsz = msg_hdr_sz(hdr);
1408 skb_copy_to_linear_data_offset(buf, INT_H_SIZE, hdr, hsz);
1409 msg_dbg(buf_msg(buf), ">BUILD>");
1411 /* Chop up message: */
1413 fragm_crs = INT_H_SIZE + hsz;
1414 fragm_rest = fragm_sz - hsz;
1416 do { /* For all sections */
1420 sect_rest = msg_sect[++curr_sect].iov_len;
1421 sect_crs = (const unchar *)msg_sect[curr_sect].iov_base;
1424 if (sect_rest < fragm_rest)
1429 if (likely(!sender->user_port)) {
1430 if (copy_from_user(buf->data + fragm_crs, sect_crs, sz)) {
1432 for (; buf_chain; buf_chain = buf) {
1433 buf = buf_chain->next;
1434 buf_discard(buf_chain);
1439 skb_copy_to_linear_data_offset(buf, fragm_crs,
1447 if (!fragm_rest && rest) {
1449 /* Initiate new fragment: */
1450 if (rest <= fragm_sz) {
1452 msg_set_type(&fragm_hdr,LAST_FRAGMENT);
1454 msg_set_type(&fragm_hdr, FRAGMENT);
1456 msg_set_size(&fragm_hdr, fragm_sz + INT_H_SIZE);
1457 msg_set_fragm_no(&fragm_hdr, ++fragm_no);
1459 buf = buf_acquire(fragm_sz + INT_H_SIZE);
1465 skb_copy_to_linear_data(buf, &fragm_hdr, INT_H_SIZE);
1466 fragm_crs = INT_H_SIZE;
1467 fragm_rest = fragm_sz;
1468 msg_dbg(buf_msg(buf)," >BUILD>");
1474 * Now we have a buffer chain. Select a link and check
1475 * that packet size is still OK
1477 node = tipc_node_select(destaddr, sender->publ.ref & 1);
1479 tipc_node_lock(node);
1480 l_ptr = node->active_links[sender->publ.ref & 1];
1482 tipc_node_unlock(node);
1485 if (link_max_pkt(l_ptr) < max_pkt) {
1486 sender->publ.max_pkt = link_max_pkt(l_ptr);
1487 tipc_node_unlock(node);
1488 for (; buf_chain; buf_chain = buf) {
1489 buf = buf_chain->next;
1490 buf_discard(buf_chain);
1496 for (; buf_chain; buf_chain = buf) {
1497 buf = buf_chain->next;
1498 buf_discard(buf_chain);
1500 return tipc_port_reject_sections(sender, hdr, msg_sect, num_sect,
1504 /* Append whole chain to send queue: */
1507 l_ptr->long_msg_seq_no = mod(l_ptr->long_msg_seq_no + 1);
1508 if (!l_ptr->next_out)
1509 l_ptr->next_out = buf_chain;
1510 l_ptr->stats.sent_fragmented++;
1512 struct sk_buff *next = buf->next;
1513 struct tipc_msg *msg = buf_msg(buf);
1515 l_ptr->stats.sent_fragments++;
1516 msg_set_long_msgno(msg, l_ptr->long_msg_seq_no);
1517 link_add_to_outqueue(l_ptr, buf, msg);
1518 msg_dbg(msg, ">ADD>");
1522 /* Send it, if possible: */
1524 tipc_link_push_queue(l_ptr);
1525 tipc_node_unlock(node);
1530 * tipc_link_push_packet: Push one unsent packet to the media
1532 u32 tipc_link_push_packet(struct link *l_ptr)
1534 struct sk_buff *buf = l_ptr->first_out;
1535 u32 r_q_size = l_ptr->retransm_queue_size;
1536 u32 r_q_head = l_ptr->retransm_queue_head;
1538 /* Step to position where retransmission failed, if any, */
1539 /* consider that buffers may have been released in meantime */
1541 if (r_q_size && buf) {
1542 u32 last = lesser(mod(r_q_head + r_q_size),
1543 link_last_sent(l_ptr));
1544 u32 first = msg_seqno(buf_msg(buf));
1546 while (buf && less(first, r_q_head)) {
1547 first = mod(first + 1);
1550 l_ptr->retransm_queue_head = r_q_head = first;
1551 l_ptr->retransm_queue_size = r_q_size = mod(last - first);
1554 /* Continue retransmission now, if there is anything: */
1556 if (r_q_size && buf) {
1557 msg_set_ack(buf_msg(buf), mod(l_ptr->next_in_no - 1));
1558 msg_set_bcast_ack(buf_msg(buf), l_ptr->owner->bclink.last_in);
1559 if (tipc_bearer_send(l_ptr->b_ptr, buf, &l_ptr->media_addr)) {
1560 msg_dbg(buf_msg(buf), ">DEF-RETR>");
1561 l_ptr->retransm_queue_head = mod(++r_q_head);
1562 l_ptr->retransm_queue_size = --r_q_size;
1563 l_ptr->stats.retransmitted++;
1566 l_ptr->stats.bearer_congs++;
1567 msg_dbg(buf_msg(buf), "|>DEF-RETR>");
1572 /* Send deferred protocol message, if any: */
1574 buf = l_ptr->proto_msg_queue;
1576 msg_set_ack(buf_msg(buf), mod(l_ptr->next_in_no - 1));
1577 msg_set_bcast_ack(buf_msg(buf),l_ptr->owner->bclink.last_in);
1578 if (tipc_bearer_send(l_ptr->b_ptr, buf, &l_ptr->media_addr)) {
1579 msg_dbg(buf_msg(buf), ">DEF-PROT>");
1580 l_ptr->unacked_window = 0;
1582 l_ptr->proto_msg_queue = NULL;
1585 msg_dbg(buf_msg(buf), "|>DEF-PROT>");
1586 l_ptr->stats.bearer_congs++;
1591 /* Send one deferred data message, if send window not full: */
1593 buf = l_ptr->next_out;
1595 struct tipc_msg *msg = buf_msg(buf);
1596 u32 next = msg_seqno(msg);
1597 u32 first = msg_seqno(buf_msg(l_ptr->first_out));
1599 if (mod(next - first) < l_ptr->queue_limit[0]) {
1600 msg_set_ack(msg, mod(l_ptr->next_in_no - 1));
1601 msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in);
1602 if (tipc_bearer_send(l_ptr->b_ptr, buf, &l_ptr->media_addr)) {
1603 if (msg_user(msg) == MSG_BUNDLER)
1604 msg_set_type(msg, CLOSED_MSG);
1605 msg_dbg(msg, ">PUSH-DATA>");
1606 l_ptr->next_out = buf->next;
1609 msg_dbg(msg, "|PUSH-DATA|");
1610 l_ptr->stats.bearer_congs++;
1615 return PUSH_FINISHED;
1619 * push_queue(): push out the unsent messages of a link where
1620 * congestion has abated. Node is locked
1622 void tipc_link_push_queue(struct link *l_ptr)
1626 if (tipc_bearer_congested(l_ptr->b_ptr, l_ptr))
1630 res = tipc_link_push_packet(l_ptr);
1633 if (res == PUSH_FAILED)
1634 tipc_bearer_schedule(l_ptr->b_ptr, l_ptr);
1637 static void link_reset_all(unsigned long addr)
1639 struct tipc_node *n_ptr;
1640 char addr_string[16];
1643 read_lock_bh(&tipc_net_lock);
1644 n_ptr = tipc_node_find((u32)addr);
1646 read_unlock_bh(&tipc_net_lock);
1647 return; /* node no longer exists */
1650 tipc_node_lock(n_ptr);
1652 warn("Resetting all links to %s\n",
1653 addr_string_fill(addr_string, n_ptr->addr));
1655 for (i = 0; i < MAX_BEARERS; i++) {
1656 if (n_ptr->links[i]) {
1657 link_print(n_ptr->links[i], TIPC_OUTPUT,
1658 "Resetting link\n");
1659 tipc_link_reset(n_ptr->links[i]);
1663 tipc_node_unlock(n_ptr);
1664 read_unlock_bh(&tipc_net_lock);
1667 static void link_retransmit_failure(struct link *l_ptr, struct sk_buff *buf)
1669 struct tipc_msg *msg = buf_msg(buf);
1671 warn("Retransmission failure on link <%s>\n", l_ptr->name);
1672 tipc_msg_dbg(TIPC_OUTPUT, msg, ">RETR-FAIL>");
1676 /* Handle failure on standard link */
1678 link_print(l_ptr, TIPC_OUTPUT, "Resetting link\n");
1679 tipc_link_reset(l_ptr);
1683 /* Handle failure on broadcast link */
1685 struct tipc_node *n_ptr;
1686 char addr_string[16];
1688 tipc_printf(TIPC_OUTPUT, "Msg seq number: %u, ", msg_seqno(msg));
1689 tipc_printf(TIPC_OUTPUT, "Outstanding acks: %lu\n",
1690 (unsigned long) TIPC_SKB_CB(buf)->handle);
1692 n_ptr = l_ptr->owner->next;
1693 tipc_node_lock(n_ptr);
1695 addr_string_fill(addr_string, n_ptr->addr);
1696 tipc_printf(TIPC_OUTPUT, "Multicast link info for %s\n", addr_string);
1697 tipc_printf(TIPC_OUTPUT, "Supported: %d, ", n_ptr->bclink.supported);
1698 tipc_printf(TIPC_OUTPUT, "Acked: %u\n", n_ptr->bclink.acked);
1699 tipc_printf(TIPC_OUTPUT, "Last in: %u, ", n_ptr->bclink.last_in);
1700 tipc_printf(TIPC_OUTPUT, "Gap after: %u, ", n_ptr->bclink.gap_after);
1701 tipc_printf(TIPC_OUTPUT, "Gap to: %u\n", n_ptr->bclink.gap_to);
1702 tipc_printf(TIPC_OUTPUT, "Nack sync: %u\n\n", n_ptr->bclink.nack_sync);
1704 tipc_k_signal((Handler)link_reset_all, (unsigned long)n_ptr->addr);
1706 tipc_node_unlock(n_ptr);
1708 l_ptr->stale_count = 0;
1712 void tipc_link_retransmit(struct link *l_ptr, struct sk_buff *buf,
1715 struct tipc_msg *msg;
1722 dbg("Retransmitting %u in link %x\n", retransmits, l_ptr);
1724 if (tipc_bearer_congested(l_ptr->b_ptr, l_ptr)) {
1725 if (l_ptr->retransm_queue_size == 0) {
1726 msg_dbg(msg, ">NO_RETR->BCONG>");
1727 dbg_print_link(l_ptr, " ");
1728 l_ptr->retransm_queue_head = msg_seqno(msg);
1729 l_ptr->retransm_queue_size = retransmits;
1731 err("Unexpected retransmit on link %s (qsize=%d)\n",
1732 l_ptr->name, l_ptr->retransm_queue_size);
1736 /* Detect repeated retransmit failures on uncongested bearer */
1738 if (l_ptr->last_retransmitted == msg_seqno(msg)) {
1739 if (++l_ptr->stale_count > 100) {
1740 link_retransmit_failure(l_ptr, buf);
1744 l_ptr->last_retransmitted = msg_seqno(msg);
1745 l_ptr->stale_count = 1;
1749 while (retransmits && (buf != l_ptr->next_out) && buf) {
1751 msg_set_ack(msg, mod(l_ptr->next_in_no - 1));
1752 msg_set_bcast_ack(msg, l_ptr->owner->bclink.last_in);
1753 if (tipc_bearer_send(l_ptr->b_ptr, buf, &l_ptr->media_addr)) {
1754 msg_dbg(buf_msg(buf), ">RETR>");
1757 l_ptr->stats.retransmitted++;
1759 tipc_bearer_schedule(l_ptr->b_ptr, l_ptr);
1760 l_ptr->stats.bearer_congs++;
1761 l_ptr->retransm_queue_head = msg_seqno(buf_msg(buf));
1762 l_ptr->retransm_queue_size = retransmits;
1767 l_ptr->retransm_queue_head = l_ptr->retransm_queue_size = 0;
1771 * link_insert_deferred_queue - insert deferred messages back into receive chain
1774 static struct sk_buff *link_insert_deferred_queue(struct link *l_ptr,
1775 struct sk_buff *buf)
1779 if (l_ptr->oldest_deferred_in == NULL)
1782 seq_no = msg_seqno(buf_msg(l_ptr->oldest_deferred_in));
1783 if (seq_no == mod(l_ptr->next_in_no)) {
1784 l_ptr->newest_deferred_in->next = buf;
1785 buf = l_ptr->oldest_deferred_in;
1786 l_ptr->oldest_deferred_in = NULL;
1787 l_ptr->deferred_inqueue_sz = 0;
1793 * link_recv_buf_validate - validate basic format of received message
1795 * This routine ensures a TIPC message has an acceptable header, and at least
1796 * as much data as the header indicates it should. The routine also ensures
1797 * that the entire message header is stored in the main fragment of the message
1798 * buffer, to simplify future access to message header fields.
1800 * Note: Having extra info present in the message header or data areas is OK.
1801 * TIPC will ignore the excess, under the assumption that it is optional info
1802 * introduced by a later release of the protocol.
1805 static int link_recv_buf_validate(struct sk_buff *buf)
1807 static u32 min_data_hdr_size[8] = {
1808 SHORT_H_SIZE, MCAST_H_SIZE, LONG_H_SIZE, DIR_MSG_H_SIZE,
1809 MAX_H_SIZE, MAX_H_SIZE, MAX_H_SIZE, MAX_H_SIZE
1812 struct tipc_msg *msg;
1818 if (unlikely(buf->len < MIN_H_SIZE))
1821 msg = skb_header_pointer(buf, 0, sizeof(tipc_hdr), tipc_hdr);
1825 if (unlikely(msg_version(msg) != TIPC_VERSION))
1828 size = msg_size(msg);
1829 hdr_size = msg_hdr_sz(msg);
1830 min_hdr_size = msg_isdata(msg) ?
1831 min_data_hdr_size[msg_type(msg)] : INT_H_SIZE;
1833 if (unlikely((hdr_size < min_hdr_size) ||
1834 (size < hdr_size) ||
1835 (buf->len < size) ||
1836 (size - hdr_size > TIPC_MAX_USER_MSG_SIZE)))
1839 return pskb_may_pull(buf, hdr_size);
1842 void tipc_recv_msg(struct sk_buff *head, struct tipc_bearer *tb_ptr)
1844 read_lock_bh(&tipc_net_lock);
1846 struct bearer *b_ptr = (struct bearer *)tb_ptr;
1847 struct tipc_node *n_ptr;
1849 struct sk_buff *crs;
1850 struct sk_buff *buf = head;
1851 struct tipc_msg *msg;
1859 /* Ensure message is well-formed */
1861 if (unlikely(!link_recv_buf_validate(buf)))
1864 /* Ensure message data is a single contiguous unit */
1866 if (unlikely(buf_linearize(buf))) {
1870 /* Handle arrival of a non-unicast link message */
1874 if (unlikely(msg_non_seq(msg))) {
1875 if (msg_user(msg) == LINK_CONFIG)
1876 tipc_disc_recv_msg(buf, b_ptr);
1878 tipc_bclink_recv_pkt(buf);
1882 if (unlikely(!msg_short(msg) &&
1883 (msg_destnode(msg) != tipc_own_addr)))
1886 /* Discard non-routeable messages destined for another node */
1888 if (unlikely(!msg_isdata(msg) &&
1889 (msg_destnode(msg) != tipc_own_addr))) {
1890 if ((msg_user(msg) != CONN_MANAGER) &&
1891 (msg_user(msg) != MSG_FRAGMENTER))
1895 /* Locate unicast link endpoint that should handle message */
1897 n_ptr = tipc_node_find(msg_prevnode(msg));
1898 if (unlikely(!n_ptr))
1900 tipc_node_lock(n_ptr);
1902 l_ptr = n_ptr->links[b_ptr->identity];
1903 if (unlikely(!l_ptr)) {
1904 tipc_node_unlock(n_ptr);
1908 /* Validate message sequence number info */
1910 seq_no = msg_seqno(msg);
1911 ackd = msg_ack(msg);
1913 /* Release acked messages */
1915 if (less(n_ptr->bclink.acked, msg_bcast_ack(msg))) {
1916 if (tipc_node_is_up(n_ptr) && n_ptr->bclink.supported)
1917 tipc_bclink_acknowledge(n_ptr, msg_bcast_ack(msg));
1920 crs = l_ptr->first_out;
1921 while ((crs != l_ptr->next_out) &&
1922 less_eq(msg_seqno(buf_msg(crs)), ackd)) {
1923 struct sk_buff *next = crs->next;
1930 l_ptr->first_out = crs;
1931 l_ptr->out_queue_size -= released;
1934 /* Try sending any messages link endpoint has pending */
1936 if (unlikely(l_ptr->next_out))
1937 tipc_link_push_queue(l_ptr);
1938 if (unlikely(!list_empty(&l_ptr->waiting_ports)))
1939 tipc_link_wakeup_ports(l_ptr, 0);
1940 if (unlikely(++l_ptr->unacked_window >= TIPC_MIN_LINK_WIN)) {
1941 l_ptr->stats.sent_acks++;
1942 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0);
1945 /* Now (finally!) process the incoming message */
1948 if (likely(link_working_working(l_ptr))) {
1949 if (likely(seq_no == mod(l_ptr->next_in_no))) {
1950 l_ptr->next_in_no++;
1951 if (unlikely(l_ptr->oldest_deferred_in))
1952 head = link_insert_deferred_queue(l_ptr,
1954 if (likely(msg_is_dest(msg, tipc_own_addr))) {
1956 if (likely(msg_isdata(msg))) {
1957 tipc_node_unlock(n_ptr);
1958 tipc_port_recv_msg(buf);
1961 switch (msg_user(msg)) {
1963 l_ptr->stats.recv_bundles++;
1964 l_ptr->stats.recv_bundled +=
1966 tipc_node_unlock(n_ptr);
1967 tipc_link_recv_bundle(buf);
1969 case ROUTE_DISTRIBUTOR:
1970 tipc_node_unlock(n_ptr);
1971 tipc_cltr_recv_routing_table(buf);
1973 case NAME_DISTRIBUTOR:
1974 tipc_node_unlock(n_ptr);
1975 tipc_named_recv(buf);
1978 tipc_node_unlock(n_ptr);
1979 tipc_port_recv_proto_msg(buf);
1981 case MSG_FRAGMENTER:
1982 l_ptr->stats.recv_fragments++;
1983 if (tipc_link_recv_fragment(&l_ptr->defragm_buf,
1985 l_ptr->stats.recv_fragmented++;
1989 case CHANGEOVER_PROTOCOL:
1990 type = msg_type(msg);
1991 if (link_recv_changeover_msg(&l_ptr, &buf)) {
1993 seq_no = msg_seqno(msg);
1994 if (type == ORIGINAL_MSG)
1996 goto protocol_check;
2001 tipc_node_unlock(n_ptr);
2002 tipc_net_route_msg(buf);
2005 link_handle_out_of_seq_msg(l_ptr, buf);
2006 head = link_insert_deferred_queue(l_ptr, head);
2007 tipc_node_unlock(n_ptr);
2011 if (msg_user(msg) == LINK_PROTOCOL) {
2012 link_recv_proto_msg(l_ptr, buf);
2013 head = link_insert_deferred_queue(l_ptr, head);
2014 tipc_node_unlock(n_ptr);
2017 msg_dbg(msg,"NSEQ<REC<");
2018 link_state_event(l_ptr, TRAFFIC_MSG_EVT);
2020 if (link_working_working(l_ptr)) {
2021 /* Re-insert in front of queue */
2022 msg_dbg(msg,"RECV-REINS:");
2025 tipc_node_unlock(n_ptr);
2028 tipc_node_unlock(n_ptr);
2032 read_unlock_bh(&tipc_net_lock);
2036 * link_defer_buf(): Sort a received out-of-sequence packet
2037 * into the deferred reception queue.
2038 * Returns the increase of the queue length,i.e. 0 or 1
2041 u32 tipc_link_defer_pkt(struct sk_buff **head,
2042 struct sk_buff **tail,
2043 struct sk_buff *buf)
2045 struct sk_buff *prev = NULL;
2046 struct sk_buff *crs = *head;
2047 u32 seq_no = msg_seqno(buf_msg(buf));
2052 if (*head == NULL) {
2053 *head = *tail = buf;
2058 if (less(msg_seqno(buf_msg(*tail)), seq_no)) {
2059 (*tail)->next = buf;
2064 /* Scan through queue and sort it in */
2066 struct tipc_msg *msg = buf_msg(crs);
2068 if (less(seq_no, msg_seqno(msg))) {
2076 if (seq_no == msg_seqno(msg)) {
2084 /* Message is a duplicate of an existing message */
2091 * link_handle_out_of_seq_msg - handle arrival of out-of-sequence packet
2094 static void link_handle_out_of_seq_msg(struct link *l_ptr,
2095 struct sk_buff *buf)
2097 u32 seq_no = msg_seqno(buf_msg(buf));
2099 if (likely(msg_user(buf_msg(buf)) == LINK_PROTOCOL)) {
2100 link_recv_proto_msg(l_ptr, buf);
2104 dbg("rx OOS msg: seq_no %u, expecting %u (%u)\n",
2105 seq_no, mod(l_ptr->next_in_no), l_ptr->next_in_no);
2107 /* Record OOS packet arrival (force mismatch on next timeout) */
2109 l_ptr->checkpoint--;
2112 * Discard packet if a duplicate; otherwise add it to deferred queue
2113 * and notify peer of gap as per protocol specification
2116 if (less(seq_no, mod(l_ptr->next_in_no))) {
2117 l_ptr->stats.duplicates++;
2122 if (tipc_link_defer_pkt(&l_ptr->oldest_deferred_in,
2123 &l_ptr->newest_deferred_in, buf)) {
2124 l_ptr->deferred_inqueue_sz++;
2125 l_ptr->stats.deferred_recv++;
2126 if ((l_ptr->deferred_inqueue_sz % 16) == 1)
2127 tipc_link_send_proto_msg(l_ptr, STATE_MSG, 0, 0, 0, 0, 0);
2129 l_ptr->stats.duplicates++;
2133 * Send protocol message to the other endpoint.
2135 void tipc_link_send_proto_msg(struct link *l_ptr, u32 msg_typ, int probe_msg,
2136 u32 gap, u32 tolerance, u32 priority, u32 ack_mtu)
2138 struct sk_buff *buf = NULL;
2139 struct tipc_msg *msg = l_ptr->pmsg;
2140 u32 msg_size = sizeof(l_ptr->proto_msg);
2142 if (link_blocked(l_ptr))
2144 msg_set_type(msg, msg_typ);
2145 msg_set_net_plane(msg, l_ptr->b_ptr->net_plane);
2146 msg_set_bcast_ack(msg, mod(l_ptr->owner->bclink.last_in));
2147 msg_set_last_bcast(msg, tipc_bclink_get_last_sent());
2149 if (msg_typ == STATE_MSG) {
2150 u32 next_sent = mod(l_ptr->next_out_no);
2152 if (!tipc_link_is_up(l_ptr))
2154 if (l_ptr->next_out)
2155 next_sent = msg_seqno(buf_msg(l_ptr->next_out));
2156 msg_set_next_sent(msg, next_sent);
2157 if (l_ptr->oldest_deferred_in) {
2158 u32 rec = msg_seqno(buf_msg(l_ptr->oldest_deferred_in));
2159 gap = mod(rec - mod(l_ptr->next_in_no));
2161 msg_set_seq_gap(msg, gap);
2163 l_ptr->stats.sent_nacks++;
2164 msg_set_link_tolerance(msg, tolerance);
2165 msg_set_linkprio(msg, priority);
2166 msg_set_max_pkt(msg, ack_mtu);
2167 msg_set_ack(msg, mod(l_ptr->next_in_no - 1));
2168 msg_set_probe(msg, probe_msg != 0);
2170 u32 mtu = l_ptr->max_pkt;
2172 if ((mtu < l_ptr->max_pkt_target) &&
2173 link_working_working(l_ptr) &&
2174 l_ptr->fsm_msg_cnt) {
2175 msg_size = (mtu + (l_ptr->max_pkt_target - mtu)/2 + 2) & ~3;
2176 if (l_ptr->max_pkt_probes == 10) {
2177 l_ptr->max_pkt_target = (msg_size - 4);
2178 l_ptr->max_pkt_probes = 0;
2179 msg_size = (mtu + (l_ptr->max_pkt_target - mtu)/2 + 2) & ~3;
2181 l_ptr->max_pkt_probes++;
2184 l_ptr->stats.sent_probes++;
2186 l_ptr->stats.sent_states++;
2187 } else { /* RESET_MSG or ACTIVATE_MSG */
2188 msg_set_ack(msg, mod(l_ptr->reset_checkpoint - 1));
2189 msg_set_seq_gap(msg, 0);
2190 msg_set_next_sent(msg, 1);
2191 msg_set_link_tolerance(msg, l_ptr->tolerance);
2192 msg_set_linkprio(msg, l_ptr->priority);
2193 msg_set_max_pkt(msg, l_ptr->max_pkt_target);
2196 if (tipc_node_has_redundant_links(l_ptr->owner)) {
2197 msg_set_redundant_link(msg);
2199 msg_clear_redundant_link(msg);
2201 msg_set_linkprio(msg, l_ptr->priority);
2203 /* Ensure sequence number will not fit : */
2205 msg_set_seqno(msg, mod(l_ptr->next_out_no + (0xffff/2)));
2209 if (tipc_bearer_congested(l_ptr->b_ptr, l_ptr)) {
2210 if (!l_ptr->proto_msg_queue) {
2211 l_ptr->proto_msg_queue =
2212 buf_acquire(sizeof(l_ptr->proto_msg));
2214 buf = l_ptr->proto_msg_queue;
2217 skb_copy_to_linear_data(buf, msg, sizeof(l_ptr->proto_msg));
2220 msg_set_timestamp(msg, jiffies_to_msecs(jiffies));
2222 /* Message can be sent */
2226 buf = buf_acquire(msg_size);
2230 skb_copy_to_linear_data(buf, msg, sizeof(l_ptr->proto_msg));
2231 msg_set_size(buf_msg(buf), msg_size);
2233 if (tipc_bearer_send(l_ptr->b_ptr, buf, &l_ptr->media_addr)) {
2234 l_ptr->unacked_window = 0;
2239 /* New congestion */
2240 tipc_bearer_schedule(l_ptr->b_ptr, l_ptr);
2241 l_ptr->proto_msg_queue = buf;
2242 l_ptr->stats.bearer_congs++;
2246 * Receive protocol message :
2247 * Note that network plane id propagates through the network, and may
2248 * change at any time. The node with lowest address rules
2251 static void link_recv_proto_msg(struct link *l_ptr, struct sk_buff *buf)
2257 struct tipc_msg *msg = buf_msg(buf);
2259 dbg("AT(%u):", jiffies_to_msecs(jiffies));
2261 if (link_blocked(l_ptr))
2264 /* record unnumbered packet arrival (force mismatch on next timeout) */
2266 l_ptr->checkpoint--;
2268 if (l_ptr->b_ptr->net_plane != msg_net_plane(msg))
2269 if (tipc_own_addr > msg_prevnode(msg))
2270 l_ptr->b_ptr->net_plane = msg_net_plane(msg);
2272 l_ptr->owner->permit_changeover = msg_redundant_link(msg);
2274 switch (msg_type(msg)) {
2277 if (!link_working_unknown(l_ptr) &&
2278 (l_ptr->peer_session != INVALID_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, 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, 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;
2689 if (msg_short(inmsg))
2690 destaddr = l_ptr->addr;
2692 destaddr = msg_destnode(inmsg);
2694 if (msg_routed(inmsg))
2695 msg_set_prevnode(inmsg, tipc_own_addr);
2697 /* Prepare reusable fragment header: */
2699 msg_init(&fragm_hdr, MSG_FRAGMENTER, FIRST_FRAGMENT,
2700 INT_H_SIZE, destaddr);
2701 msg_set_link_selector(&fragm_hdr, msg_link_selector(inmsg));
2702 msg_set_long_msgno(&fragm_hdr, mod(l_ptr->long_msg_seq_no++));
2703 msg_set_fragm_no(&fragm_hdr, fragm_no);
2704 l_ptr->stats.sent_fragmented++;
2706 /* Chop up message: */
2709 struct sk_buff *fragm;
2711 if (rest <= fragm_sz) {
2713 msg_set_type(&fragm_hdr, LAST_FRAGMENT);
2715 fragm = buf_acquire(fragm_sz + INT_H_SIZE);
2716 if (fragm == NULL) {
2717 warn("Link unable to fragment message\n");
2721 msg_set_size(&fragm_hdr, fragm_sz + INT_H_SIZE);
2722 skb_copy_to_linear_data(fragm, &fragm_hdr, INT_H_SIZE);
2723 skb_copy_to_linear_data_offset(fragm, INT_H_SIZE, crs,
2725 /* Send queued messages first, if any: */
2727 l_ptr->stats.sent_fragments++;
2728 tipc_link_send_buf(l_ptr, fragm);
2729 if (!tipc_link_is_up(l_ptr))
2731 msg_set_fragm_no(&fragm_hdr, ++fragm_no);
2734 msg_set_type(&fragm_hdr, FRAGMENT);
2742 * A pending message being re-assembled must store certain values
2743 * to handle subsequent fragments correctly. The following functions
2744 * help storing these values in unused, available fields in the
2745 * pending message. This makes dynamic memory allocation unecessary.
2748 static void set_long_msg_seqno(struct sk_buff *buf, u32 seqno)
2750 msg_set_seqno(buf_msg(buf), seqno);
2753 static u32 get_fragm_size(struct sk_buff *buf)
2755 return msg_ack(buf_msg(buf));
2758 static void set_fragm_size(struct sk_buff *buf, u32 sz)
2760 msg_set_ack(buf_msg(buf), sz);
2763 static u32 get_expected_frags(struct sk_buff *buf)
2765 return msg_bcast_ack(buf_msg(buf));
2768 static void set_expected_frags(struct sk_buff *buf, u32 exp)
2770 msg_set_bcast_ack(buf_msg(buf), exp);
2773 static u32 get_timer_cnt(struct sk_buff *buf)
2775 return msg_reroute_cnt(buf_msg(buf));
2778 static void incr_timer_cnt(struct sk_buff *buf)
2780 msg_incr_reroute_cnt(buf_msg(buf));
2784 * tipc_link_recv_fragment(): Called with node lock on. Returns
2785 * the reassembled buffer if message is complete.
2787 int tipc_link_recv_fragment(struct sk_buff **pending, struct sk_buff **fb,
2788 struct tipc_msg **m)
2790 struct sk_buff *prev = NULL;
2791 struct sk_buff *fbuf = *fb;
2792 struct tipc_msg *fragm = buf_msg(fbuf);
2793 struct sk_buff *pbuf = *pending;
2794 u32 long_msg_seq_no = msg_long_msgno(fragm);
2797 msg_dbg(fragm,"FRG<REC<");
2799 /* Is there an incomplete message waiting for this fragment? */
2801 while (pbuf && ((msg_seqno(buf_msg(pbuf)) != long_msg_seq_no) ||
2802 (msg_orignode(fragm) != msg_orignode(buf_msg(pbuf))))) {
2807 if (!pbuf && (msg_type(fragm) == FIRST_FRAGMENT)) {
2808 struct tipc_msg *imsg = (struct tipc_msg *)msg_data(fragm);
2809 u32 msg_sz = msg_size(imsg);
2810 u32 fragm_sz = msg_data_sz(fragm);
2811 u32 exp_fragm_cnt = msg_sz/fragm_sz + !!(msg_sz % fragm_sz);
2812 u32 max = TIPC_MAX_USER_MSG_SIZE + LONG_H_SIZE;
2813 if (msg_type(imsg) == TIPC_MCAST_MSG)
2814 max = TIPC_MAX_USER_MSG_SIZE + MCAST_H_SIZE;
2815 if (msg_size(imsg) > max) {
2816 msg_dbg(fragm,"<REC<Oversized: ");
2820 pbuf = buf_acquire(msg_size(imsg));
2822 pbuf->next = *pending;
2824 skb_copy_to_linear_data(pbuf, imsg,
2825 msg_data_sz(fragm));
2826 /* Prepare buffer for subsequent fragments. */
2828 set_long_msg_seqno(pbuf, long_msg_seq_no);
2829 set_fragm_size(pbuf,fragm_sz);
2830 set_expected_frags(pbuf,exp_fragm_cnt - 1);
2832 warn("Link unable to reassemble fragmented message\n");
2836 } else if (pbuf && (msg_type(fragm) != FIRST_FRAGMENT)) {
2837 u32 dsz = msg_data_sz(fragm);
2838 u32 fsz = get_fragm_size(pbuf);
2839 u32 crs = ((msg_fragm_no(fragm) - 1) * fsz);
2840 u32 exp_frags = get_expected_frags(pbuf) - 1;
2841 skb_copy_to_linear_data_offset(pbuf, crs,
2842 msg_data(fragm), dsz);
2845 /* Is message complete? */
2847 if (exp_frags == 0) {
2849 prev->next = pbuf->next;
2851 *pending = pbuf->next;
2852 msg_reset_reroute_cnt(buf_msg(pbuf));
2857 set_expected_frags(pbuf,exp_frags);
2860 dbg(" Discarding orphan fragment %x\n",fbuf);
2861 msg_dbg(fragm,"ORPHAN:");
2862 dbg("Pending long buffers:\n");
2863 dbg_print_buf_chain(*pending);
2869 * link_check_defragm_bufs - flush stale incoming message fragments
2870 * @l_ptr: pointer to link
2873 static void link_check_defragm_bufs(struct link *l_ptr)
2875 struct sk_buff *prev = NULL;
2876 struct sk_buff *next = NULL;
2877 struct sk_buff *buf = l_ptr->defragm_buf;
2881 if (!link_working_working(l_ptr))
2884 u32 cnt = get_timer_cnt(buf);
2888 incr_timer_cnt(buf);
2891 dbg(" Discarding incomplete long buffer\n");
2892 msg_dbg(buf_msg(buf), "LONG:");
2893 dbg_print_link(l_ptr, "curr:");
2894 dbg("Pending long buffers:\n");
2895 dbg_print_buf_chain(l_ptr->defragm_buf);
2897 prev->next = buf->next;
2899 l_ptr->defragm_buf = buf->next;
2908 static void link_set_supervision_props(struct link *l_ptr, u32 tolerance)
2910 l_ptr->tolerance = tolerance;
2911 l_ptr->continuity_interval =
2912 ((tolerance / 4) > 500) ? 500 : tolerance / 4;
2913 l_ptr->abort_limit = tolerance / (l_ptr->continuity_interval / 4);
2917 void tipc_link_set_queue_limits(struct link *l_ptr, u32 window)
2919 /* Data messages from this node, inclusive FIRST_FRAGM */
2920 l_ptr->queue_limit[TIPC_LOW_IMPORTANCE] = window;
2921 l_ptr->queue_limit[TIPC_MEDIUM_IMPORTANCE] = (window / 3) * 4;
2922 l_ptr->queue_limit[TIPC_HIGH_IMPORTANCE] = (window / 3) * 5;
2923 l_ptr->queue_limit[TIPC_CRITICAL_IMPORTANCE] = (window / 3) * 6;
2924 /* Transiting data messages,inclusive FIRST_FRAGM */
2925 l_ptr->queue_limit[TIPC_LOW_IMPORTANCE + 4] = 300;
2926 l_ptr->queue_limit[TIPC_MEDIUM_IMPORTANCE + 4] = 600;
2927 l_ptr->queue_limit[TIPC_HIGH_IMPORTANCE + 4] = 900;
2928 l_ptr->queue_limit[TIPC_CRITICAL_IMPORTANCE + 4] = 1200;
2929 l_ptr->queue_limit[CONN_MANAGER] = 1200;
2930 l_ptr->queue_limit[ROUTE_DISTRIBUTOR] = 1200;
2931 l_ptr->queue_limit[CHANGEOVER_PROTOCOL] = 2500;
2932 l_ptr->queue_limit[NAME_DISTRIBUTOR] = 3000;
2933 /* FRAGMENT and LAST_FRAGMENT packets */
2934 l_ptr->queue_limit[MSG_FRAGMENTER] = 4000;
2938 * link_find_link - locate link by name
2939 * @name - ptr to link name string
2940 * @node - ptr to area to be filled with ptr to associated node
2942 * Caller must hold 'tipc_net_lock' to ensure node and bearer are not deleted;
2943 * this also prevents link deletion.
2945 * Returns pointer to link (or 0 if invalid link name).
2948 static struct link *link_find_link(const char *name, struct tipc_node **node)
2950 struct link_name link_name_parts;
2951 struct bearer *b_ptr;
2954 if (!link_name_validate(name, &link_name_parts))
2957 b_ptr = tipc_bearer_find_interface(link_name_parts.if_local);
2961 *node = tipc_node_find(link_name_parts.addr_peer);
2965 l_ptr = (*node)->links[b_ptr->identity];
2966 if (!l_ptr || strcmp(l_ptr->name, name))
2972 struct sk_buff *tipc_link_cmd_config(const void *req_tlv_area, int req_tlv_space,
2975 struct tipc_link_config *args;
2978 struct tipc_node *node;
2981 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_LINK_CONFIG))
2982 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
2984 args = (struct tipc_link_config *)TLV_DATA(req_tlv_area);
2985 new_value = ntohl(args->value);
2987 if (!strcmp(args->name, tipc_bclink_name)) {
2988 if ((cmd == TIPC_CMD_SET_LINK_WINDOW) &&
2989 (tipc_bclink_set_queue_limits(new_value) == 0))
2990 return tipc_cfg_reply_none();
2991 return tipc_cfg_reply_error_string(TIPC_CFG_NOT_SUPPORTED
2992 " (cannot change setting on broadcast link)");
2995 read_lock_bh(&tipc_net_lock);
2996 l_ptr = link_find_link(args->name, &node);
2998 read_unlock_bh(&tipc_net_lock);
2999 return tipc_cfg_reply_error_string("link not found");
3002 tipc_node_lock(node);
3005 case TIPC_CMD_SET_LINK_TOL:
3006 if ((new_value >= TIPC_MIN_LINK_TOL) &&
3007 (new_value <= TIPC_MAX_LINK_TOL)) {
3008 link_set_supervision_props(l_ptr, new_value);
3009 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
3010 0, 0, new_value, 0, 0);
3014 case TIPC_CMD_SET_LINK_PRI:
3015 if ((new_value >= TIPC_MIN_LINK_PRI) &&
3016 (new_value <= TIPC_MAX_LINK_PRI)) {
3017 l_ptr->priority = new_value;
3018 tipc_link_send_proto_msg(l_ptr, STATE_MSG,
3019 0, 0, 0, new_value, 0);
3023 case TIPC_CMD_SET_LINK_WINDOW:
3024 if ((new_value >= TIPC_MIN_LINK_WIN) &&
3025 (new_value <= TIPC_MAX_LINK_WIN)) {
3026 tipc_link_set_queue_limits(l_ptr, new_value);
3031 tipc_node_unlock(node);
3033 read_unlock_bh(&tipc_net_lock);
3035 return tipc_cfg_reply_error_string("cannot change link setting");
3037 return tipc_cfg_reply_none();
3041 * link_reset_statistics - reset link statistics
3042 * @l_ptr: pointer to link
3045 static void link_reset_statistics(struct link *l_ptr)
3047 memset(&l_ptr->stats, 0, sizeof(l_ptr->stats));
3048 l_ptr->stats.sent_info = l_ptr->next_out_no;
3049 l_ptr->stats.recv_info = l_ptr->next_in_no;
3052 struct sk_buff *tipc_link_cmd_reset_stats(const void *req_tlv_area, int req_tlv_space)
3056 struct tipc_node *node;
3058 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_LINK_NAME))
3059 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
3061 link_name = (char *)TLV_DATA(req_tlv_area);
3062 if (!strcmp(link_name, tipc_bclink_name)) {
3063 if (tipc_bclink_reset_stats())
3064 return tipc_cfg_reply_error_string("link not found");
3065 return tipc_cfg_reply_none();
3068 read_lock_bh(&tipc_net_lock);
3069 l_ptr = link_find_link(link_name, &node);
3071 read_unlock_bh(&tipc_net_lock);
3072 return tipc_cfg_reply_error_string("link not found");
3075 tipc_node_lock(node);
3076 link_reset_statistics(l_ptr);
3077 tipc_node_unlock(node);
3078 read_unlock_bh(&tipc_net_lock);
3079 return tipc_cfg_reply_none();
3083 * percent - convert count to a percentage of total (rounding up or down)
3086 static u32 percent(u32 count, u32 total)
3088 return (count * 100 + (total / 2)) / total;
3092 * tipc_link_stats - print link statistics
3094 * @buf: print buffer area
3095 * @buf_size: size of print buffer area
3097 * Returns length of print buffer data string (or 0 if error)
3100 static int tipc_link_stats(const char *name, char *buf, const u32 buf_size)
3102 struct print_buf pb;
3104 struct tipc_node *node;
3106 u32 profile_total = 0;
3108 if (!strcmp(name, tipc_bclink_name))
3109 return tipc_bclink_stats(buf, buf_size);
3111 tipc_printbuf_init(&pb, buf, buf_size);
3113 read_lock_bh(&tipc_net_lock);
3114 l_ptr = link_find_link(name, &node);
3116 read_unlock_bh(&tipc_net_lock);
3119 tipc_node_lock(node);
3121 if (tipc_link_is_active(l_ptr))
3123 else if (tipc_link_is_up(l_ptr))
3127 tipc_printf(&pb, "Link <%s>\n"
3128 " %s MTU:%u Priority:%u Tolerance:%u ms"
3129 " Window:%u packets\n",
3130 l_ptr->name, status, link_max_pkt(l_ptr),
3131 l_ptr->priority, l_ptr->tolerance, l_ptr->queue_limit[0]);
3132 tipc_printf(&pb, " RX packets:%u fragments:%u/%u bundles:%u/%u\n",
3133 l_ptr->next_in_no - l_ptr->stats.recv_info,
3134 l_ptr->stats.recv_fragments,
3135 l_ptr->stats.recv_fragmented,
3136 l_ptr->stats.recv_bundles,
3137 l_ptr->stats.recv_bundled);
3138 tipc_printf(&pb, " TX packets:%u fragments:%u/%u bundles:%u/%u\n",
3139 l_ptr->next_out_no - l_ptr->stats.sent_info,
3140 l_ptr->stats.sent_fragments,
3141 l_ptr->stats.sent_fragmented,
3142 l_ptr->stats.sent_bundles,
3143 l_ptr->stats.sent_bundled);
3144 profile_total = l_ptr->stats.msg_length_counts;
3147 tipc_printf(&pb, " TX profile sample:%u packets average:%u octets\n"
3148 " 0-64:%u%% -256:%u%% -1024:%u%% -4096:%u%% "
3149 "-16354:%u%% -32768:%u%% -66000:%u%%\n",
3150 l_ptr->stats.msg_length_counts,
3151 l_ptr->stats.msg_lengths_total / profile_total,
3152 percent(l_ptr->stats.msg_length_profile[0], profile_total),
3153 percent(l_ptr->stats.msg_length_profile[1], profile_total),
3154 percent(l_ptr->stats.msg_length_profile[2], profile_total),
3155 percent(l_ptr->stats.msg_length_profile[3], profile_total),
3156 percent(l_ptr->stats.msg_length_profile[4], profile_total),
3157 percent(l_ptr->stats.msg_length_profile[5], profile_total),
3158 percent(l_ptr->stats.msg_length_profile[6], profile_total));
3159 tipc_printf(&pb, " RX states:%u probes:%u naks:%u defs:%u dups:%u\n",
3160 l_ptr->stats.recv_states,
3161 l_ptr->stats.recv_probes,
3162 l_ptr->stats.recv_nacks,
3163 l_ptr->stats.deferred_recv,
3164 l_ptr->stats.duplicates);
3165 tipc_printf(&pb, " TX states:%u probes:%u naks:%u acks:%u dups:%u\n",
3166 l_ptr->stats.sent_states,
3167 l_ptr->stats.sent_probes,
3168 l_ptr->stats.sent_nacks,
3169 l_ptr->stats.sent_acks,
3170 l_ptr->stats.retransmitted);
3171 tipc_printf(&pb, " Congestion bearer:%u link:%u Send queue max:%u avg:%u\n",
3172 l_ptr->stats.bearer_congs,
3173 l_ptr->stats.link_congs,
3174 l_ptr->stats.max_queue_sz,
3175 l_ptr->stats.queue_sz_counts
3176 ? (l_ptr->stats.accu_queue_sz / l_ptr->stats.queue_sz_counts)
3179 tipc_node_unlock(node);
3180 read_unlock_bh(&tipc_net_lock);
3181 return tipc_printbuf_validate(&pb);
3184 #define MAX_LINK_STATS_INFO 2000
3186 struct sk_buff *tipc_link_cmd_show_stats(const void *req_tlv_area, int req_tlv_space)
3188 struct sk_buff *buf;
3189 struct tlv_desc *rep_tlv;
3192 if (!TLV_CHECK(req_tlv_area, req_tlv_space, TIPC_TLV_LINK_NAME))
3193 return tipc_cfg_reply_error_string(TIPC_CFG_TLV_ERROR);
3195 buf = tipc_cfg_reply_alloc(TLV_SPACE(MAX_LINK_STATS_INFO));
3199 rep_tlv = (struct tlv_desc *)buf->data;
3201 str_len = tipc_link_stats((char *)TLV_DATA(req_tlv_area),
3202 (char *)TLV_DATA(rep_tlv), MAX_LINK_STATS_INFO);
3205 return tipc_cfg_reply_error_string("link not found");
3208 skb_put(buf, TLV_SPACE(str_len));
3209 TLV_SET(rep_tlv, TIPC_TLV_ULTRA_STRING, NULL, str_len);
3215 int link_control(const char *name, u32 op, u32 val)
3220 struct tipc_node * node;
3223 a = link_name2addr(name, &bearer_id);
3224 read_lock_bh(&tipc_net_lock);
3225 node = tipc_node_find(a);
3227 tipc_node_lock(node);
3228 l_ptr = node->links[bearer_id];
3230 if (op == TIPC_REMOVE_LINK) {
3231 struct bearer *b_ptr = l_ptr->b_ptr;
3232 spin_lock_bh(&b_ptr->publ.lock);
3233 tipc_link_delete(l_ptr);
3234 spin_unlock_bh(&b_ptr->publ.lock);
3236 if (op == TIPC_CMD_BLOCK_LINK) {
3237 tipc_link_reset(l_ptr);
3240 if (op == TIPC_CMD_UNBLOCK_LINK) {
3245 tipc_node_unlock(node);
3247 read_unlock_bh(&tipc_net_lock);
3253 * tipc_link_get_max_pkt - get maximum packet size to use when sending to destination
3254 * @dest: network address of destination node
3255 * @selector: used to select from set of active links
3257 * If no active link can be found, uses default maximum packet size.
3260 u32 tipc_link_get_max_pkt(u32 dest, u32 selector)
3262 struct tipc_node *n_ptr;
3264 u32 res = MAX_PKT_DEFAULT;
3266 if (dest == tipc_own_addr)
3267 return MAX_MSG_SIZE;
3269 read_lock_bh(&tipc_net_lock);
3270 n_ptr = tipc_node_select(dest, selector);
3272 tipc_node_lock(n_ptr);
3273 l_ptr = n_ptr->active_links[selector & 1];
3275 res = link_max_pkt(l_ptr);
3276 tipc_node_unlock(n_ptr);
3278 read_unlock_bh(&tipc_net_lock);
3283 static void link_dump_rec_queue(struct link *l_ptr)
3285 struct sk_buff *crs;
3287 if (!l_ptr->oldest_deferred_in) {
3288 info("Reception queue empty\n");
3291 info("Contents of Reception queue:\n");
3292 crs = l_ptr->oldest_deferred_in;
3294 if (crs->data == (void *)0x0000a3a3) {
3295 info("buffer %x invalid\n", crs);
3298 msg_dbg(buf_msg(crs), "In rec queue:\n");
3304 static void link_dump_send_queue(struct link *l_ptr)
3306 if (l_ptr->next_out) {
3307 info("\nContents of unsent queue:\n");
3308 dbg_print_buf_chain(l_ptr->next_out);
3310 info("\nContents of send queue:\n");
3311 if (l_ptr->first_out) {
3312 dbg_print_buf_chain(l_ptr->first_out);
3314 info("Empty send queue\n");
3317 static void link_print(struct link *l_ptr, struct print_buf *buf,
3320 tipc_printf(buf, str);
3321 if (link_reset_reset(l_ptr) || link_reset_unknown(l_ptr))
3323 tipc_printf(buf, "Link %x<%s>:",
3324 l_ptr->addr, l_ptr->b_ptr->publ.name);
3325 tipc_printf(buf, ": NXO(%u):", mod(l_ptr->next_out_no));
3326 tipc_printf(buf, "NXI(%u):", mod(l_ptr->next_in_no));
3327 tipc_printf(buf, "SQUE");
3328 if (l_ptr->first_out) {
3329 tipc_printf(buf, "[%u..", msg_seqno(buf_msg(l_ptr->first_out)));
3330 if (l_ptr->next_out)
3331 tipc_printf(buf, "%u..",
3332 msg_seqno(buf_msg(l_ptr->next_out)));
3333 tipc_printf(buf, "%u]",
3335 (l_ptr->last_out)), l_ptr->out_queue_size);
3336 if ((mod(msg_seqno(buf_msg(l_ptr->last_out)) -
3337 msg_seqno(buf_msg(l_ptr->first_out)))
3338 != (l_ptr->out_queue_size - 1)) ||
3339 (l_ptr->last_out->next != NULL)) {
3340 tipc_printf(buf, "\nSend queue inconsistency\n");
3341 tipc_printf(buf, "first_out= %x ", l_ptr->first_out);
3342 tipc_printf(buf, "next_out= %x ", l_ptr->next_out);
3343 tipc_printf(buf, "last_out= %x ", l_ptr->last_out);
3344 link_dump_send_queue(l_ptr);
3347 tipc_printf(buf, "[]");
3348 tipc_printf(buf, "SQSIZ(%u)", l_ptr->out_queue_size);
3349 if (l_ptr->oldest_deferred_in) {
3350 u32 o = msg_seqno(buf_msg(l_ptr->oldest_deferred_in));
3351 u32 n = msg_seqno(buf_msg(l_ptr->newest_deferred_in));
3352 tipc_printf(buf, ":RQUE[%u..%u]", o, n);
3353 if (l_ptr->deferred_inqueue_sz != mod((n + 1) - o)) {
3354 tipc_printf(buf, ":RQSIZ(%u)",
3355 l_ptr->deferred_inqueue_sz);
3358 if (link_working_unknown(l_ptr))
3359 tipc_printf(buf, ":WU");
3360 if (link_reset_reset(l_ptr))
3361 tipc_printf(buf, ":RR");
3362 if (link_reset_unknown(l_ptr))
3363 tipc_printf(buf, ":RU");
3364 if (link_working_working(l_ptr))
3365 tipc_printf(buf, ":WW");
3366 tipc_printf(buf, "\n");