link.h 10.3 KB
Newer Older
P
Per Liden 已提交
1 2
/*
 * net/tipc/link.h: Include file for TIPC link code
3
 *
4
 * Copyright (c) 1995-2006, 2013-2014, Ericsson AB
5
 * Copyright (c) 2004-2005, 2010-2011, Wind River Systems
P
Per Liden 已提交
6 7
 * All rights reserved.
 *
P
Per Liden 已提交
8
 * Redistribution and use in source and binary forms, with or without
P
Per Liden 已提交
9 10
 * modification, are permitted provided that the following conditions are met:
 *
P
Per Liden 已提交
11 12 13 14 15 16 17 18
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the names of the copyright holders nor the names of its
 *    contributors may be used to endorse or promote products derived from
 *    this software without specific prior written permission.
P
Per Liden 已提交
19
 *
P
Per Liden 已提交
20 21 22 23 24 25 26 27 28 29 30 31 32 33
 * Alternatively, this software may be distributed under the terms of the
 * GNU General Public License ("GPL") version 2 as published by the Free
 * Software Foundation.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
P
Per Liden 已提交
34 35 36 37 38 39
 * POSSIBILITY OF SUCH DAMAGE.
 */

#ifndef _TIPC_LINK_H
#define _TIPC_LINK_H

40
#include <net/genetlink.h>
P
Per Liden 已提交
41 42 43
#include "msg.h"
#include "node.h"

Y
Ying Xue 已提交
44 45 46 47
/* TIPC-specific error codes
*/
#define ELINKCONG EAGAIN	/* link congestion <=> resource unavailable */

48
/* Out-of-range value for link sequence numbers
49 50 51
 */
#define INVALID_LINK_SEQ 0x10000

52
/* Link working states
P
Per Liden 已提交
53 54 55 56 57 58
 */
#define WORKING_WORKING 560810u
#define WORKING_UNKNOWN 560811u
#define RESET_UNKNOWN   560812u
#define RESET_RESET     560813u

59 60 61
/* Link endpoint execution states
 */
#define LINK_STARTED    0x0001
62
#define LINK_STOPPED    0x0002
63
#define LINK_SYNCHING   0x0004
64 65

/* Starting value for maximum packet size negotiation on unicast links
P
Per Liden 已提交
66 67 68 69
 * (unless bearer MTU is less)
 */
#define MAX_PKT_DEFAULT 1500

70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99
struct tipc_stats {
	u32 sent_info;		/* used in counting # sent packets */
	u32 recv_info;		/* used in counting # recv'd packets */
	u32 sent_states;
	u32 recv_states;
	u32 sent_probes;
	u32 recv_probes;
	u32 sent_nacks;
	u32 recv_nacks;
	u32 sent_acks;
	u32 sent_bundled;
	u32 sent_bundles;
	u32 recv_bundled;
	u32 recv_bundles;
	u32 retransmitted;
	u32 sent_fragmented;
	u32 sent_fragments;
	u32 recv_fragmented;
	u32 recv_fragments;
	u32 link_congs;		/* # port sends blocked by congestion */
	u32 deferred_recv;
	u32 duplicates;
	u32 max_queue_sz;	/* send queue size high water mark */
	u32 accu_queue_sz;	/* used for send queue size profiling */
	u32 queue_sz_counts;	/* used for send queue size profiling */
	u32 msg_length_counts;	/* used for message length profiling */
	u32 msg_lengths_total;	/* used for message length profiling */
	u32 msg_length_profile[7]; /* used for msg. length profiling */
};

P
Per Liden 已提交
100
/**
101
 * struct tipc_link - TIPC link data structure
P
Per Liden 已提交
102 103 104 105 106
 * @addr: network address of link's peer node
 * @name: link name character string
 * @media_addr: media address to use when sending messages over link
 * @timer: link timer
 * @owner: pointer to peer node
107
 * @refcnt: reference counter for permanent references (owner node & timer)
108
 * @flags: execution state flags for link endpoint instance
P
Per Liden 已提交
109 110 111
 * @checkpoint: reference point for triggering link continuity checking
 * @peer_session: link session # being used by peer end of link
 * @peer_bearer_id: bearer id used by link's peer endpoint
112
 * @bearer_id: local bearer id used by link
113
 * @tolerance: minimum link continuity loss needed to reset link [in ms]
114
 * @cont_intv: link continuity testing interval
P
Per Liden 已提交
115 116 117 118 119 120
 * @abort_limit: # of unacknowledged continuity probes needed to reset link
 * @state: current state of link FSM
 * @fsm_msg_cnt: # of protocol messages link FSM has sent in current state
 * @proto_msg: template for control messages generated by link
 * @pmsg: convenience pointer to "proto_msg" field
 * @priority: current link priority
121
 * @net_plane: current link network plane ('A' through 'H')
122
 * @backlog_limit: backlog queue congestion thresholds (indexed by importance)
P
Per Liden 已提交
123 124 125 126 127
 * @exp_msg_count: # of tunnelled messages expected during link changeover
 * @reset_checkpoint: seq # of last acknowledged message at time of link reset
 * @max_pkt: current maximum packet size for this link
 * @max_pkt_target: desired maximum packet size for this link
 * @max_pkt_probes: # of probes based on current (max_pkt, max_pkt_target)
J
Jon Paul Maloy 已提交
128 129
 * @transmitq: queue for sent, non-acked messages
 * @backlogq: queue for messages waiting to be sent
P
Per Liden 已提交
130 131 132 133
 * @next_out_no: next sequence number to use for outbound messages
 * @last_retransmitted: sequence number of most recently retransmitted message
 * @stale_count: # of identical retransmit requests made by peer
 * @next_in_no: next sequence number to expect for inbound messages
134
 * @deferred_queue: deferred queue saved OOS b'cast message received from node
P
Per Liden 已提交
135
 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer
136 137
 * @inputq: buffer queue for messages to be delivered upwards
 * @namedq: buffer queue for name table messages to be delivered upwards
P
Per Liden 已提交
138
 * @next_out: ptr to first unsent outbound message in queue
139
 * @wakeupq: linked list of wakeup msgs waiting for link congestion to abate
P
Per Liden 已提交
140
 * @long_msg_seq_no: next identifier to use for outbound fragmented messages
141
 * @reasm_buf: head of partially reassembled inbound message fragments
P
Per Liden 已提交
142 143
 * @stats: collects statistics regarding link activity
 */
144
struct tipc_link {
P
Per Liden 已提交
145 146 147 148
	u32 addr;
	char name[TIPC_MAX_LINK_NAME];
	struct tipc_media_addr media_addr;
	struct timer_list timer;
149
	struct tipc_node *owner;
150
	struct kref ref;
P
Per Liden 已提交
151 152

	/* Management and link supervision data */
153
	unsigned int flags;
P
Per Liden 已提交
154 155 156
	u32 checkpoint;
	u32 peer_session;
	u32 peer_bearer_id;
157
	u32 bearer_id;
P
Per Liden 已提交
158
	u32 tolerance;
159
	unsigned long cont_intv;
P
Per Liden 已提交
160 161 162 163 164 165 166 167 168
	u32 abort_limit;
	int state;
	u32 fsm_msg_cnt;
	struct {
		unchar hdr[INT_H_SIZE];
		unchar body[TIPC_MAX_IF_NAME];
	} proto_msg;
	struct tipc_msg *pmsg;
	u32 priority;
169
	char net_plane;
P
Per Liden 已提交
170 171 172 173

	/* Changeover */
	u32 exp_msg_count;
	u32 reset_checkpoint;
174
	u32 synch_point;
P
Per Liden 已提交
175

176 177 178 179
	/* Max packet negotiation */
	u32 max_pkt;
	u32 max_pkt_target;
	u32 max_pkt_probes;
P
Per Liden 已提交
180 181

	/* Sending */
J
Jon Paul Maloy 已提交
182 183
	struct sk_buff_head transmq;
	struct sk_buff_head backlogq;
184 185 186 187
	struct {
		u16 len;
		u16 limit;
	} backlog[5];
P
Per Liden 已提交
188
	u32 next_out_no;
J
Jon Paul Maloy 已提交
189
	u32 window;
190 191
	u32 last_retransmitted;
	u32 stale_count;
P
Per Liden 已提交
192 193 194

	/* Reception */
	u32 next_in_no;
J
Jon Paul Maloy 已提交
195 196
	u32 rcv_unacked;
	struct sk_buff_head deferdq;
197 198
	struct sk_buff_head inputq;
	struct sk_buff_head namedq;
P
Per Liden 已提交
199 200

	/* Congestion handling */
201
	struct sk_buff_head wakeupq;
P
Per Liden 已提交
202

203
	/* Fragmentation/reassembly */
P
Per Liden 已提交
204
	u32 long_msg_seq_no;
205
	struct sk_buff *reasm_buf;
P
Per Liden 已提交
206

207
	/* Statistics */
208
	struct tipc_stats stats;
P
Per Liden 已提交
209 210
};

211
struct tipc_port;
P
Per Liden 已提交
212

213
struct tipc_link *tipc_link_create(struct tipc_node *n_ptr,
214
			      struct tipc_bearer *b_ptr,
215
			      const struct tipc_media_addr *media_addr);
216
void tipc_link_delete(struct tipc_link *link);
217 218
void tipc_link_delete_list(struct net *net, unsigned int bearer_id,
			   bool shutting_down);
219
void tipc_link_failover_send_queue(struct tipc_link *l_ptr);
220
void tipc_link_dup_queue_xmit(struct tipc_link *l_ptr, struct tipc_link *dest);
221 222 223
void tipc_link_reset_fragments(struct tipc_link *l_ptr);
int tipc_link_is_up(struct tipc_link *l_ptr);
int tipc_link_is_active(struct tipc_link *l_ptr);
224
void tipc_link_purge_queues(struct tipc_link *l_ptr);
225
void tipc_link_reset_all(struct tipc_node *node);
226
void tipc_link_reset(struct tipc_link *l_ptr);
227 228 229 230 231
void tipc_link_reset_list(struct net *net, unsigned int bearer_id);
int tipc_link_xmit_skb(struct net *net, struct sk_buff *skb, u32 dest,
		       u32 selector);
int tipc_link_xmit(struct net *net, struct sk_buff_head *list, u32 dest,
		   u32 selector);
232 233
int __tipc_link_xmit(struct net *net, struct tipc_link *link,
		     struct sk_buff_head *list);
234 235
void tipc_link_proto_xmit(struct tipc_link *l_ptr, u32 msg_typ, int prob,
			  u32 gap, u32 tolerance, u32 priority, u32 acked_mtu);
236
void tipc_link_push_packets(struct tipc_link *l_ptr);
237
u32 tipc_link_defer_pkt(struct sk_buff_head *list, struct sk_buff *buf);
238 239 240
void tipc_link_set_queue_limits(struct tipc_link *l_ptr, u32 window);
void tipc_link_retransmit(struct tipc_link *l_ptr,
			  struct sk_buff *start, u32 retransmits);
241 242
struct sk_buff *tipc_skb_queue_next(const struct sk_buff_head *list,
				    const struct sk_buff *skb);
P
Per Liden 已提交
243

244 245
int tipc_nl_link_dump(struct sk_buff *skb, struct netlink_callback *cb);
int tipc_nl_link_get(struct sk_buff *skb, struct genl_info *info);
246
int tipc_nl_link_set(struct sk_buff *skb, struct genl_info *info);
247
int tipc_nl_link_reset_stats(struct sk_buff *skb, struct genl_info *info);
248
int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[]);
249
void link_prepare_wakeup(struct tipc_link *l);
250

P
Per Liden 已提交
251 252 253
/*
 * Link sequence number manipulation routines (uses modulo 2**16 arithmetic)
 */
254 255 256 257 258
static inline u32 buf_seqno(struct sk_buff *buf)
{
	return msg_seqno(buf_msg(buf));
}

P
Per Liden 已提交
259 260 261 262 263 264 265
static inline u32 mod(u32 x)
{
	return x & 0xffffu;
}

static inline int less_eq(u32 left, u32 right)
{
E
Eric Dumazet 已提交
266
	return mod(right - left) < 32768u;
P
Per Liden 已提交
267 268
}

269 270 271 272 273
static inline int more(u32 left, u32 right)
{
	return !less_eq(left, right);
}

P
Per Liden 已提交
274 275
static inline int less(u32 left, u32 right)
{
E
Eric Dumazet 已提交
276
	return less_eq(left, right) && (mod(right) != mod(left));
P
Per Liden 已提交
277 278 279 280 281 282 283
}

static inline u32 lesser(u32 left, u32 right)
{
	return less_eq(left, right) ? left : right;
}

284 285 286 287
static inline u32 link_own_addr(struct tipc_link *l)
{
	return msg_prevnode(l->pmsg);
}
288 289 290 291

/*
 * Link status checking routines
 */
292
static inline int link_working_working(struct tipc_link *l_ptr)
293
{
E
Eric Dumazet 已提交
294
	return l_ptr->state == WORKING_WORKING;
295 296
}

297
static inline int link_working_unknown(struct tipc_link *l_ptr)
298
{
E
Eric Dumazet 已提交
299
	return l_ptr->state == WORKING_UNKNOWN;
300 301
}

302
static inline int link_reset_unknown(struct tipc_link *l_ptr)
303
{
E
Eric Dumazet 已提交
304
	return l_ptr->state == RESET_UNKNOWN;
305 306
}

307
static inline int link_reset_reset(struct tipc_link *l_ptr)
308
{
E
Eric Dumazet 已提交
309
	return l_ptr->state == RESET_RESET;
310 311
}

P
Per Liden 已提交
312
#endif