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