link.h 11.0 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 FSM events:
53
 */
54
enum {
55 56 57 58 59 60 61 62
	LINK_ESTABLISH_EVT       = 0xec1ab1e,
	LINK_PEER_RESET_EVT      = 0x9eed0e,
	LINK_FAILURE_EVT         = 0xfa110e,
	LINK_RESET_EVT           = 0x10ca1d0e,
	LINK_FAILOVER_BEGIN_EVT  = 0xfa110bee,
	LINK_FAILOVER_END_EVT    = 0xfa110ede,
	LINK_SYNCH_BEGIN_EVT     = 0xc1ccbee,
	LINK_SYNCH_END_EVT       = 0xc1ccede
63
};
64

65
/* Events returned from link at packet reception or at timeout
66 67 68
 */
enum {
	TIPC_LINK_UP_EVT       = 1,
69 70
	TIPC_LINK_DOWN_EVT     = (1 << 1),
	TIPC_LINK_SND_BC_ACK   = (1 << 2)
71 72
};

73
/* Starting value for maximum packet size negotiation on unicast links
P
Per Liden 已提交
74 75 76 77
 * (unless bearer MTU is less)
 */
#define MAX_PKT_DEFAULT 1500

78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107
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 已提交
108
/**
109
 * struct tipc_link - TIPC link data structure
P
Per Liden 已提交
110 111 112 113 114
 * @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
115
 * @refcnt: reference counter for permanent references (owner node & timer)
P
Per Liden 已提交
116 117
 * @peer_session: link session # being used by peer end of link
 * @peer_bearer_id: bearer id used by link's peer endpoint
118
 * @bearer_id: local bearer id used by link
119
 * @tolerance: minimum link continuity loss needed to reset link [in ms]
120
 * @keepalive_intv: link keepalive timer interval
P
Per Liden 已提交
121 122
 * @abort_limit: # of unacknowledged continuity probes needed to reset link
 * @state: current state of link FSM
123
 * @peer_caps: bitmap describing capabilities of peer node
124
 * @silent_intv_cnt: # of timer intervals without any reception from peer
P
Per Liden 已提交
125 126 127
 * @proto_msg: template for control messages generated by link
 * @pmsg: convenience pointer to "proto_msg" field
 * @priority: current link priority
128
 * @net_plane: current link network plane ('A' through 'H')
129
 * @backlog_limit: backlog queue congestion thresholds (indexed by importance)
P
Per Liden 已提交
130
 * @exp_msg_count: # of tunnelled messages expected during link changeover
131
 * @reset_rcv_checkpt: seq # of last acknowledged message at time of link reset
132 133
 * @mtu: current maximum packet size for this link
 * @advertised_mtu: advertised own mtu when link is being established
J
Jon Paul Maloy 已提交
134 135
 * @transmitq: queue for sent, non-acked messages
 * @backlogq: queue for messages waiting to be sent
136
 * @snt_nxt: next sequence number to use for outbound messages
P
Per Liden 已提交
137 138
 * @last_retransmitted: sequence number of most recently retransmitted message
 * @stale_count: # of identical retransmit requests made by peer
139 140
 * @ackers: # of peers that needs to ack each packet before it can be released
 * @acked: # last packet acked by a certain peer. Used for broadcast.
141
 * @rcv_nxt: next sequence number to expect for inbound messages
142
 * @deferred_queue: deferred queue saved OOS b'cast message received from node
P
Per Liden 已提交
143
 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer
144 145
 * @inputq: buffer queue for messages to be delivered upwards
 * @namedq: buffer queue for name table messages to be delivered upwards
P
Per Liden 已提交
146
 * @next_out: ptr to first unsent outbound message in queue
147
 * @wakeupq: linked list of wakeup msgs waiting for link congestion to abate
P
Per Liden 已提交
148
 * @long_msg_seq_no: next identifier to use for outbound fragmented messages
149
 * @reasm_buf: head of partially reassembled inbound message fragments
150
 * @bc_rcvr: marks that this is a broadcast receiver link
P
Per Liden 已提交
151 152
 * @stats: collects statistics regarding link activity
 */
153
struct tipc_link {
P
Per Liden 已提交
154 155
	u32 addr;
	char name[TIPC_MAX_LINK_NAME];
J
Jon Paul Maloy 已提交
156
	struct tipc_media_addr *media_addr;
157
	struct tipc_node *owner;
P
Per Liden 已提交
158 159 160 161

	/* Management and link supervision data */
	u32 peer_session;
	u32 peer_bearer_id;
162
	u32 bearer_id;
P
Per Liden 已提交
163
	u32 tolerance;
164
	unsigned long keepalive_intv;
P
Per Liden 已提交
165
	u32 abort_limit;
166
	u32 state;
167
	u16 peer_caps;
168
	u32 silent_intv_cnt;
P
Per Liden 已提交
169 170 171 172 173 174
	struct {
		unchar hdr[INT_H_SIZE];
		unchar body[TIPC_MAX_IF_NAME];
	} proto_msg;
	struct tipc_msg *pmsg;
	u32 priority;
175
	char net_plane;
P
Per Liden 已提交
176

177 178 179
	/* Failover/synch */
	u16 drop_point;
	struct sk_buff *failover_reasm_skb;
P
Per Liden 已提交
180

181
	/* Max packet negotiation */
182 183
	u16 mtu;
	u16 advertised_mtu;
P
Per Liden 已提交
184 185

	/* Sending */
J
Jon Paul Maloy 已提交
186 187
	struct sk_buff_head transmq;
	struct sk_buff_head backlogq;
188 189 190 191
	struct {
		u16 len;
		u16 limit;
	} backlog[5];
192 193
	u16 snd_nxt;
	u16 last_retransm;
194
	u16 window;
195
	u32 stale_count;
P
Per Liden 已提交
196 197

	/* Reception */
198
	u16 rcv_nxt;
J
Jon Paul Maloy 已提交
199 200
	u32 rcv_unacked;
	struct sk_buff_head deferdq;
201 202
	struct sk_buff_head *inputq;
	struct sk_buff_head *namedq;
P
Per Liden 已提交
203 204

	/* Congestion handling */
205
	struct sk_buff_head wakeupq;
P
Per Liden 已提交
206

207
	/* Fragmentation/reassembly */
208
	struct sk_buff *reasm_buf;
P
Per Liden 已提交
209

210 211 212
	/* Broadcast */
	u16 ackers;
	u16 acked;
213 214 215 216
	struct tipc_link *bc_rcvlink;
	struct tipc_link *bc_sndlink;
	int nack_state;
	bool bc_peer_is_up;
217

218
	/* Statistics */
219
	struct tipc_stats stats;
P
Per Liden 已提交
220 221
};

222 223 224
bool tipc_link_create(struct tipc_node *n, char *if_name, int bearer_id,
		      int tolerance, char net_plane, u32 mtu, int priority,
		      int window, u32 session, u32 ownnode, u32 peer,
225 226 227 228 229 230
		      u16 peer_caps,
		      struct tipc_media_addr *maddr,
		      struct tipc_link *bc_sndlink,
		      struct tipc_link *bc_rcvlink,
		      struct sk_buff_head *inputq,
		      struct sk_buff_head *namedq,
J
Jon Paul Maloy 已提交
231
		      struct tipc_link **link);
232 233 234
bool tipc_link_bc_create(struct tipc_node *n, u32 ownnode, u32 peer,
			 int mtu, int window, u16 peer_caps,
			 struct sk_buff_head *inputq,
235
			 struct sk_buff_head *namedq,
236
			 struct tipc_link *bc_sndlink,
237
			 struct tipc_link **link);
238 239
void tipc_link_tnl_prepare(struct tipc_link *l, struct tipc_link *tnl,
			   int mtyp, struct sk_buff_head *xmitq);
240
void tipc_link_build_reset_msg(struct tipc_link *l, struct sk_buff_head *xmitq);
241
int tipc_link_fsm_evt(struct tipc_link *l, int evt);
242
void tipc_link_reset_fragments(struct tipc_link *l_ptr);
243
bool tipc_link_is_up(struct tipc_link *l);
244
bool tipc_link_peer_is_down(struct tipc_link *l);
245
bool tipc_link_is_reset(struct tipc_link *l);
246
bool tipc_link_is_establishing(struct tipc_link *l);
247 248 249
bool tipc_link_is_synching(struct tipc_link *l);
bool tipc_link_is_failingover(struct tipc_link *l);
bool tipc_link_is_blocked(struct tipc_link *l);
250
int tipc_link_is_active(struct tipc_link *l_ptr);
251
void tipc_link_purge_queues(struct tipc_link *l_ptr);
252
void tipc_link_purge_backlog(struct tipc_link *l);
253
void tipc_link_reset(struct tipc_link *l_ptr);
254 255
int __tipc_link_xmit(struct net *net, struct tipc_link *link,
		     struct sk_buff_head *list);
256 257
int tipc_link_xmit(struct tipc_link *link,	struct sk_buff_head *list,
		   struct sk_buff_head *xmitq);
258
void tipc_link_proto_xmit(struct tipc_link *l_ptr, u32 msg_typ, int prob,
259
			  u32 gap, u32 tolerance, u32 priority);
260
void tipc_link_push_packets(struct tipc_link *l_ptr);
261
u32 tipc_link_defer_pkt(struct sk_buff_head *list, struct sk_buff *buf);
262 263 264
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);
265 266
struct sk_buff *tipc_skb_queue_next(const struct sk_buff_head *list,
				    const struct sk_buff *skb);
P
Per Liden 已提交
267

268 269
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);
270
int tipc_nl_link_set(struct sk_buff *skb, struct genl_info *info);
271
int tipc_nl_link_reset_stats(struct sk_buff *skb, struct genl_info *info);
272
int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[]);
273
int tipc_link_timeout(struct tipc_link *l, struct sk_buff_head *xmitq);
274 275
int tipc_link_rcv(struct tipc_link *l, struct sk_buff *skb,
		  struct sk_buff_head *xmitq);
276 277 278 279 280 281 282
int tipc_link_build_ack_msg(struct tipc_link *l, struct sk_buff_head *xmitq);
void tipc_link_add_bc_peer(struct tipc_link *snd_l,
			   struct tipc_link *uc_l,
			   struct sk_buff_head *xmitq);
void tipc_link_remove_bc_peer(struct tipc_link *snd_l,
			      struct tipc_link *rcv_l,
			      struct sk_buff_head *xmitq);
283
int tipc_link_bc_peers(struct tipc_link *l);
284 285 286 287 288 289 290 291 292
void tipc_link_bc_ack_rcv(struct tipc_link *l, u16 acked,
			  struct sk_buff_head *xmitq);
void tipc_link_build_bc_sync_msg(struct tipc_link *l,
				 struct sk_buff_head *xmitq);
void tipc_link_bc_init_rcv(struct tipc_link *l, struct tipc_msg *hdr);
void tipc_link_bc_sync_rcv(struct tipc_link *l,   struct tipc_msg *hdr,
			   struct sk_buff_head *xmitq);
int tipc_link_bc_nack_rcv(struct tipc_link *l, struct sk_buff *skb,
			  struct sk_buff_head *xmitq);
P
Per Liden 已提交
293
#endif