2 * net/tipc/link.h: Include file for TIPC link code
4 * Copyright (c) 1995-2006, 2013-2014, Ericsson AB
5 * Copyright (c) 2004-2005, 2010-2011, Wind River Systems
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
40 #include <net/genetlink.h>
44 /* TIPC-specific error codes
46 #define ELINKCONG EAGAIN /* link congestion <=> resource unavailable */
48 /* Out-of-range value for link sequence numbers
50 #define INVALID_LINK_SEQ 0x10000
53 /* Link endpoint receive states
61 /* Starting value for maximum packet size negotiation on unicast links
62 * (unless bearer MTU is less)
64 #define MAX_PKT_DEFAULT 1500
67 u32 sent_info; /* used in counting # sent packets */
68 u32 recv_info; /* used in counting # recv'd packets */
85 u32 link_congs; /* # port sends blocked by congestion */
88 u32 max_queue_sz; /* send queue size high water mark */
89 u32 accu_queue_sz; /* used for send queue size profiling */
90 u32 queue_sz_counts; /* used for send queue size profiling */
91 u32 msg_length_counts; /* used for message length profiling */
92 u32 msg_lengths_total; /* used for message length profiling */
93 u32 msg_length_profile[7]; /* used for msg. length profiling */
97 * struct tipc_link - TIPC link data structure
98 * @addr: network address of link's peer node
99 * @name: link name character string
100 * @media_addr: media address to use when sending messages over link
102 * @owner: pointer to peer node
103 * @refcnt: reference counter for permanent references (owner node & timer)
104 * @peer_session: link session # being used by peer end of link
105 * @peer_bearer_id: bearer id used by link's peer endpoint
106 * @bearer_id: local bearer id used by link
107 * @tolerance: minimum link continuity loss needed to reset link [in ms]
108 * @keepalive_intv: link keepalive timer interval
109 * @abort_limit: # of unacknowledged continuity probes needed to reset link
110 * @state: current state of link FSM
111 * @silent_intv_cnt: # of timer intervals without any reception from peer
112 * @proto_msg: template for control messages generated by link
113 * @pmsg: convenience pointer to "proto_msg" field
114 * @priority: current link priority
115 * @net_plane: current link network plane ('A' through 'H')
116 * @exec_mode: transmit/receive mode for link endpoint instance
117 * @backlog_limit: backlog queue congestion thresholds (indexed by importance)
118 * @exp_msg_count: # of tunnelled messages expected during link changeover
119 * @reset_rcv_checkpt: seq # of last acknowledged message at time of link reset
120 * @mtu: current maximum packet size for this link
121 * @advertised_mtu: advertised own mtu when link is being established
122 * @transmitq: queue for sent, non-acked messages
123 * @backlogq: queue for messages waiting to be sent
124 * @snt_nxt: next sequence number to use for outbound messages
125 * @last_retransmitted: sequence number of most recently retransmitted message
126 * @stale_count: # of identical retransmit requests made by peer
127 * @rcv_nxt: next sequence number to expect for inbound messages
128 * @deferred_queue: deferred queue saved OOS b'cast message received from node
129 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer
130 * @inputq: buffer queue for messages to be delivered upwards
131 * @namedq: buffer queue for name table messages to be delivered upwards
132 * @next_out: ptr to first unsent outbound message in queue
133 * @wakeupq: linked list of wakeup msgs waiting for link congestion to abate
134 * @long_msg_seq_no: next identifier to use for outbound fragmented messages
135 * @reasm_buf: head of partially reassembled inbound message fragments
136 * @stats: collects statistics regarding link activity
140 char name[TIPC_MAX_LINK_NAME];
141 struct tipc_media_addr media_addr;
142 struct timer_list timer;
143 struct tipc_node *owner;
146 /* Management and link supervision data */
151 unsigned long keepalive_intv;
156 unchar hdr[INT_H_SIZE];
157 unchar body[TIPC_MAX_IF_NAME];
159 struct tipc_msg *pmsg;
167 u16 failover_checkpt;
168 struct sk_buff *failover_skb;
170 /* Max packet negotiation */
175 struct sk_buff_head transmq;
176 struct sk_buff_head backlogq;
189 struct sk_buff_head deferdq;
190 struct sk_buff_head *inputq;
191 struct sk_buff_head *namedq;
193 /* Congestion handling */
194 struct sk_buff_head wakeupq;
196 /* Fragmentation/reassembly */
197 struct sk_buff *reasm_buf;
200 struct tipc_stats stats;
205 struct tipc_link *tipc_link_create(struct tipc_node *n,
206 struct tipc_bearer *b,
207 const struct tipc_media_addr *maddr,
208 struct sk_buff_head *inputq,
209 struct sk_buff_head *namedq);
210 void tipc_link_delete(struct tipc_link *link);
211 void tipc_link_delete_list(struct net *net, unsigned int bearer_id);
212 void tipc_link_failover_send_queue(struct tipc_link *l_ptr);
213 void tipc_link_dup_queue_xmit(struct tipc_link *l_ptr, struct tipc_link *dest);
214 void tipc_link_reset_fragments(struct tipc_link *l_ptr);
215 int tipc_link_is_up(struct tipc_link *l_ptr);
216 int tipc_link_is_active(struct tipc_link *l_ptr);
217 void tipc_link_purge_queues(struct tipc_link *l_ptr);
218 void tipc_link_purge_backlog(struct tipc_link *l);
219 void tipc_link_reset_all(struct tipc_node *node);
220 void tipc_link_reset(struct tipc_link *l_ptr);
221 int __tipc_link_xmit(struct net *net, struct tipc_link *link,
222 struct sk_buff_head *list);
223 int tipc_link_xmit(struct tipc_link *link, struct sk_buff_head *list,
224 struct sk_buff_head *xmitq);
225 void tipc_link_proto_xmit(struct tipc_link *l_ptr, u32 msg_typ, int prob,
226 u32 gap, u32 tolerance, u32 priority);
227 void tipc_link_push_packets(struct tipc_link *l_ptr);
228 u32 tipc_link_defer_pkt(struct sk_buff_head *list, struct sk_buff *buf);
229 void tipc_link_set_queue_limits(struct tipc_link *l_ptr, u32 window);
230 void tipc_link_retransmit(struct tipc_link *l_ptr,
231 struct sk_buff *start, u32 retransmits);
232 struct sk_buff *tipc_skb_queue_next(const struct sk_buff_head *list,
233 const struct sk_buff *skb);
235 int tipc_nl_link_dump(struct sk_buff *skb, struct netlink_callback *cb);
236 int tipc_nl_link_get(struct sk_buff *skb, struct genl_info *info);
237 int tipc_nl_link_set(struct sk_buff *skb, struct genl_info *info);
238 int tipc_nl_link_reset_stats(struct sk_buff *skb, struct genl_info *info);
239 int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[]);
240 void link_prepare_wakeup(struct tipc_link *l);
242 static inline u32 link_own_addr(struct tipc_link *l)
244 return msg_prevnode(l->pmsg);