]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - net/tipc/link.h
tipc: eliminate unnecessary call to broadcast ack function
[mirror_ubuntu-artful-kernel.git] / net / tipc / link.h
CommitLineData
b97bf3fd
PL
1/*
2 * net/tipc/link.h: Include file for TIPC link code
c4307285 3 *
50100a5e 4 * Copyright (c) 1995-2006, 2013-2014, Ericsson AB
23dd4cce 5 * Copyright (c) 2004-2005, 2010-2011, Wind River Systems
b97bf3fd
PL
6 * All rights reserved.
7 *
9ea1fd3c 8 * Redistribution and use in source and binary forms, with or without
b97bf3fd
PL
9 * modification, are permitted provided that the following conditions are met:
10 *
9ea1fd3c
PL
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the names of the copyright holders nor the names of its
17 * contributors may be used to endorse or promote products derived from
18 * this software without specific prior written permission.
b97bf3fd 19 *
9ea1fd3c
PL
20 * Alternatively, this software may be distributed under the terms of the
21 * GNU General Public License ("GPL") version 2 as published by the Free
22 * Software Foundation.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
b97bf3fd
PL
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#ifndef _TIPC_LINK_H
38#define _TIPC_LINK_H
39
0655f6a8 40#include <net/genetlink.h>
b97bf3fd 41#include "msg.h"
b97bf3fd
PL
42#include "node.h"
43
859fc7c0
YX
44/* TIPC-specific error codes
45*/
46#define ELINKCONG EAGAIN /* link congestion <=> resource unavailable */
47
135daee6 48/* Out-of-range value for link sequence numbers
36559591 49 */
36559591
AS
50#define INVALID_LINK_SEQ 0x10000
51
135daee6 52/* Link working states
b97bf3fd 53 */
b97bf3fd
PL
54#define WORKING_WORKING 560810u
55#define WORKING_UNKNOWN 560811u
56#define RESET_UNKNOWN 560812u
57#define RESET_RESET 560813u
58
135daee6
YX
59/* Link endpoint execution states
60 */
61#define LINK_STARTED 0x0001
c61dd61d 62#define LINK_STOPPED 0x0002
135daee6
YX
63
64/* Starting value for maximum packet size negotiation on unicast links
b97bf3fd
PL
65 * (unless bearer MTU is less)
66 */
b97bf3fd
PL
67#define MAX_PKT_DEFAULT 1500
68
7e9cab58
PG
69struct tipc_stats {
70 u32 sent_info; /* used in counting # sent packets */
71 u32 recv_info; /* used in counting # recv'd packets */
72 u32 sent_states;
73 u32 recv_states;
74 u32 sent_probes;
75 u32 recv_probes;
76 u32 sent_nacks;
77 u32 recv_nacks;
78 u32 sent_acks;
79 u32 sent_bundled;
80 u32 sent_bundles;
81 u32 recv_bundled;
82 u32 recv_bundles;
83 u32 retransmitted;
84 u32 sent_fragmented;
85 u32 sent_fragments;
86 u32 recv_fragmented;
87 u32 recv_fragments;
88 u32 link_congs; /* # port sends blocked by congestion */
7e9cab58
PG
89 u32 deferred_recv;
90 u32 duplicates;
91 u32 max_queue_sz; /* send queue size high water mark */
92 u32 accu_queue_sz; /* used for send queue size profiling */
93 u32 queue_sz_counts; /* used for send queue size profiling */
94 u32 msg_length_counts; /* used for message length profiling */
95 u32 msg_lengths_total; /* used for message length profiling */
96 u32 msg_length_profile[7]; /* used for msg. length profiling */
97};
98
b97bf3fd 99/**
a18c4bc3 100 * struct tipc_link - TIPC link data structure
b97bf3fd
PL
101 * @addr: network address of link's peer node
102 * @name: link name character string
103 * @media_addr: media address to use when sending messages over link
104 * @timer: link timer
105 * @owner: pointer to peer node
2d72d495 106 * @refcnt: reference counter for permanent references (owner node & timer)
135daee6 107 * @flags: execution state flags for link endpoint instance
b97bf3fd
PL
108 * @checkpoint: reference point for triggering link continuity checking
109 * @peer_session: link session # being used by peer end of link
110 * @peer_bearer_id: bearer id used by link's peer endpoint
7a2f7d18 111 * @bearer_id: local bearer id used by link
c4307285 112 * @tolerance: minimum link continuity loss needed to reset link [in ms]
2f55c437 113 * @cont_intv: link continuity testing interval
b97bf3fd
PL
114 * @abort_limit: # of unacknowledged continuity probes needed to reset link
115 * @state: current state of link FSM
b97bf3fd
PL
116 * @fsm_msg_cnt: # of protocol messages link FSM has sent in current state
117 * @proto_msg: template for control messages generated by link
118 * @pmsg: convenience pointer to "proto_msg" field
119 * @priority: current link priority
7a2f7d18 120 * @net_plane: current link network plane ('A' through 'H')
b97bf3fd
PL
121 * @queue_limit: outbound message queue congestion thresholds (indexed by user)
122 * @exp_msg_count: # of tunnelled messages expected during link changeover
123 * @reset_checkpoint: seq # of last acknowledged message at time of link reset
124 * @max_pkt: current maximum packet size for this link
125 * @max_pkt_target: desired maximum packet size for this link
126 * @max_pkt_probes: # of probes based on current (max_pkt, max_pkt_target)
58dc55f2 127 * @outqueue: outbound message queue
b97bf3fd
PL
128 * @next_out_no: next sequence number to use for outbound messages
129 * @last_retransmitted: sequence number of most recently retransmitted message
130 * @stale_count: # of identical retransmit requests made by peer
131 * @next_in_no: next sequence number to expect for inbound messages
bc6fecd4 132 * @deferred_queue: deferred queue saved OOS b'cast message received from node
b97bf3fd 133 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer
c637c103
JPM
134 * @inputq: buffer queue for messages to be delivered upwards
135 * @namedq: buffer queue for name table messages to be delivered upwards
b97bf3fd 136 * @next_out: ptr to first unsent outbound message in queue
c637c103 137 * @wakeupq: linked list of wakeup msgs waiting for link congestion to abate
b97bf3fd 138 * @long_msg_seq_no: next identifier to use for outbound fragmented messages
37e22164 139 * @reasm_buf: head of partially reassembled inbound message fragments
b97bf3fd 140 * @stats: collects statistics regarding link activity
b97bf3fd 141 */
a18c4bc3 142struct tipc_link {
b97bf3fd
PL
143 u32 addr;
144 char name[TIPC_MAX_LINK_NAME];
145 struct tipc_media_addr media_addr;
146 struct timer_list timer;
6c00055a 147 struct tipc_node *owner;
2d72d495 148 struct kref ref;
b97bf3fd
PL
149
150 /* Management and link supervision data */
135daee6 151 unsigned int flags;
b97bf3fd
PL
152 u32 checkpoint;
153 u32 peer_session;
154 u32 peer_bearer_id;
7a2f7d18 155 u32 bearer_id;
b97bf3fd 156 u32 tolerance;
2f55c437 157 unsigned long cont_intv;
b97bf3fd
PL
158 u32 abort_limit;
159 int state;
b97bf3fd
PL
160 u32 fsm_msg_cnt;
161 struct {
162 unchar hdr[INT_H_SIZE];
163 unchar body[TIPC_MAX_IF_NAME];
164 } proto_msg;
165 struct tipc_msg *pmsg;
166 u32 priority;
7a2f7d18 167 char net_plane;
b97bf3fd
PL
168 u32 queue_limit[15]; /* queue_limit[0]==window limit */
169
170 /* Changeover */
171 u32 exp_msg_count;
172 u32 reset_checkpoint;
173
c4307285
YH
174 /* Max packet negotiation */
175 u32 max_pkt;
176 u32 max_pkt_target;
177 u32 max_pkt_probes;
b97bf3fd
PL
178
179 /* Sending */
58dc55f2 180 struct sk_buff_head outqueue;
b97bf3fd 181 u32 next_out_no;
c4307285
YH
182 u32 last_retransmitted;
183 u32 stale_count;
b97bf3fd
PL
184
185 /* Reception */
186 u32 next_in_no;
bc6fecd4 187 struct sk_buff_head deferred_queue;
b97bf3fd 188 u32 unacked_window;
c637c103
JPM
189 struct sk_buff_head inputq;
190 struct sk_buff_head namedq;
b97bf3fd
PL
191
192 /* Congestion handling */
b97bf3fd 193 struct sk_buff *next_out;
c637c103 194 struct sk_buff_head wakeupq;
b97bf3fd 195
40ba3cdf 196 /* Fragmentation/reassembly */
b97bf3fd 197 u32 long_msg_seq_no;
37e22164 198 struct sk_buff *reasm_buf;
b97bf3fd 199
c4307285 200 /* Statistics */
7e9cab58 201 struct tipc_stats stats;
b97bf3fd
PL
202};
203
23dd4cce 204struct tipc_port;
b97bf3fd 205
a18c4bc3 206struct tipc_link *tipc_link_create(struct tipc_node *n_ptr,
37b9c08a 207 struct tipc_bearer *b_ptr,
4323add6 208 const struct tipc_media_addr *media_addr);
7d24dcdb 209void tipc_link_delete(struct tipc_link *link);
f2f9800d
YX
210void tipc_link_delete_list(struct net *net, unsigned int bearer_id,
211 bool shutting_down);
170b3927 212void tipc_link_failover_send_queue(struct tipc_link *l_ptr);
247f0f3c 213void tipc_link_dup_queue_xmit(struct tipc_link *l_ptr, struct tipc_link *dest);
a18c4bc3
PG
214void tipc_link_reset_fragments(struct tipc_link *l_ptr);
215int tipc_link_is_up(struct tipc_link *l_ptr);
216int tipc_link_is_active(struct tipc_link *l_ptr);
581465fa 217void tipc_link_purge_queues(struct tipc_link *l_ptr);
3f5a12bd 218void tipc_link_reset_all(struct tipc_node *node);
a18c4bc3 219void tipc_link_reset(struct tipc_link *l_ptr);
f2f9800d
YX
220void tipc_link_reset_list(struct net *net, unsigned int bearer_id);
221int tipc_link_xmit_skb(struct net *net, struct sk_buff *skb, u32 dest,
222 u32 selector);
223int tipc_link_xmit(struct net *net, struct sk_buff_head *list, u32 dest,
224 u32 selector);
7f9f95d9
YX
225int __tipc_link_xmit(struct net *net, struct tipc_link *link,
226 struct sk_buff_head *list);
247f0f3c
YX
227void tipc_link_proto_xmit(struct tipc_link *l_ptr, u32 msg_typ, int prob,
228 u32 gap, u32 tolerance, u32 priority, u32 acked_mtu);
47b4c9a8 229void tipc_link_push_packets(struct tipc_link *l_ptr);
bc6fecd4 230u32 tipc_link_defer_pkt(struct sk_buff_head *list, struct sk_buff *buf);
a18c4bc3
PG
231void tipc_link_set_queue_limits(struct tipc_link *l_ptr, u32 window);
232void tipc_link_retransmit(struct tipc_link *l_ptr,
233 struct sk_buff *start, u32 retransmits);
58dc55f2
YX
234struct sk_buff *tipc_skb_queue_next(const struct sk_buff_head *list,
235 const struct sk_buff *skb);
b97bf3fd 236
7be57fc6
RA
237int tipc_nl_link_dump(struct sk_buff *skb, struct netlink_callback *cb);
238int tipc_nl_link_get(struct sk_buff *skb, struct genl_info *info);
f96ce7a2 239int tipc_nl_link_set(struct sk_buff *skb, struct genl_info *info);
ae36342b 240int tipc_nl_link_reset_stats(struct sk_buff *skb, struct genl_info *info);
0655f6a8 241int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[]);
c637c103 242void link_prepare_wakeup(struct tipc_link *l);
0655f6a8 243
b97bf3fd
PL
244/*
245 * Link sequence number manipulation routines (uses modulo 2**16 arithmetic)
246 */
f905730c
AS
247static inline u32 buf_seqno(struct sk_buff *buf)
248{
249 return msg_seqno(buf_msg(buf));
250}
251
b97bf3fd
PL
252static inline u32 mod(u32 x)
253{
254 return x & 0xffffu;
255}
256
b97bf3fd
PL
257static inline int less_eq(u32 left, u32 right)
258{
a02cec21 259 return mod(right - left) < 32768u;
b97bf3fd
PL
260}
261
58dc55f2
YX
262static inline int more(u32 left, u32 right)
263{
264 return !less_eq(left, right);
265}
266
b97bf3fd
PL
267static inline int less(u32 left, u32 right)
268{
a02cec21 269 return less_eq(left, right) && (mod(right) != mod(left));
b97bf3fd
PL
270}
271
272static inline u32 lesser(u32 left, u32 right)
273{
274 return less_eq(left, right) ? left : right;
275}
276
c5898636
JPM
277static inline u32 link_own_addr(struct tipc_link *l)
278{
279 return msg_prevnode(l->pmsg);
280}
01fee256
AS
281
282/*
283 * Link status checking routines
284 */
a18c4bc3 285static inline int link_working_working(struct tipc_link *l_ptr)
01fee256 286{
a02cec21 287 return l_ptr->state == WORKING_WORKING;
01fee256
AS
288}
289
a18c4bc3 290static inline int link_working_unknown(struct tipc_link *l_ptr)
01fee256 291{
a02cec21 292 return l_ptr->state == WORKING_UNKNOWN;
01fee256
AS
293}
294
a18c4bc3 295static inline int link_reset_unknown(struct tipc_link *l_ptr)
01fee256 296{
a02cec21 297 return l_ptr->state == RESET_UNKNOWN;
01fee256
AS
298}
299
a18c4bc3 300static inline int link_reset_reset(struct tipc_link *l_ptr)
01fee256 301{
a02cec21 302 return l_ptr->state == RESET_RESET;
01fee256
AS
303}
304
a18c4bc3 305static inline int link_congested(struct tipc_link *l_ptr)
01fee256 306{
58dc55f2 307 return skb_queue_len(&l_ptr->outqueue) >= l_ptr->queue_limit[0];
01fee256
AS
308}
309
b97bf3fd 310#endif