]> git.proxmox.com Git - mirror_ubuntu-jammy-kernel.git/blame - net/tipc/link.h
tipc: make media xmit call outside node spinlock context
[mirror_ubuntu-jammy-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 */
dff29b1a
JPM
61#define LINK_STARTED 0x0001
62#define LINK_STOPPED 0x0002
63#define LINK_SYNCHING 0x0004
64#define LINK_FAILINGOVER 0x0008
135daee6
YX
65
66/* Starting value for maximum packet size negotiation on unicast links
b97bf3fd
PL
67 * (unless bearer MTU is less)
68 */
b97bf3fd
PL
69#define MAX_PKT_DEFAULT 1500
70
7e9cab58
PG
71struct tipc_stats {
72 u32 sent_info; /* used in counting # sent packets */
73 u32 recv_info; /* used in counting # recv'd packets */
74 u32 sent_states;
75 u32 recv_states;
76 u32 sent_probes;
77 u32 recv_probes;
78 u32 sent_nacks;
79 u32 recv_nacks;
80 u32 sent_acks;
81 u32 sent_bundled;
82 u32 sent_bundles;
83 u32 recv_bundled;
84 u32 recv_bundles;
85 u32 retransmitted;
86 u32 sent_fragmented;
87 u32 sent_fragments;
88 u32 recv_fragmented;
89 u32 recv_fragments;
90 u32 link_congs; /* # port sends blocked by congestion */
7e9cab58
PG
91 u32 deferred_recv;
92 u32 duplicates;
93 u32 max_queue_sz; /* send queue size high water mark */
94 u32 accu_queue_sz; /* used for send queue size profiling */
95 u32 queue_sz_counts; /* used for send queue size profiling */
96 u32 msg_length_counts; /* used for message length profiling */
97 u32 msg_lengths_total; /* used for message length profiling */
98 u32 msg_length_profile[7]; /* used for msg. length profiling */
99};
100
b97bf3fd 101/**
a18c4bc3 102 * struct tipc_link - TIPC link data structure
b97bf3fd
PL
103 * @addr: network address of link's peer node
104 * @name: link name character string
105 * @media_addr: media address to use when sending messages over link
106 * @timer: link timer
107 * @owner: pointer to peer node
2d72d495 108 * @refcnt: reference counter for permanent references (owner node & timer)
135daee6 109 * @flags: execution state flags for link endpoint instance
b97bf3fd
PL
110 * @peer_session: link session # being used by peer end of link
111 * @peer_bearer_id: bearer id used by link's peer endpoint
7a2f7d18 112 * @bearer_id: local bearer id used by link
c4307285 113 * @tolerance: minimum link continuity loss needed to reset link [in ms]
a97b9d3f 114 * @keepalive_intv: link keepalive timer interval
b97bf3fd
PL
115 * @abort_limit: # of unacknowledged continuity probes needed to reset link
116 * @state: current state of link FSM
a97b9d3f 117 * @silent_intv_cnt: # of timer intervals without any reception from peer
b97bf3fd
PL
118 * @proto_msg: template for control messages generated by link
119 * @pmsg: convenience pointer to "proto_msg" field
120 * @priority: current link priority
7a2f7d18 121 * @net_plane: current link network plane ('A' through 'H')
1f66d161 122 * @backlog_limit: backlog queue congestion thresholds (indexed by importance)
b97bf3fd 123 * @exp_msg_count: # of tunnelled messages expected during link changeover
a97b9d3f 124 * @reset_rcv_checkpt: seq # of last acknowledged message at time of link reset
ed193ece
JPM
125 * @mtu: current maximum packet size for this link
126 * @advertised_mtu: advertised own mtu when link is being established
05dcc5aa
JPM
127 * @transmitq: queue for sent, non-acked messages
128 * @backlogq: queue for messages waiting to be sent
a97b9d3f 129 * @snt_nxt: next sequence number to use for outbound messages
b97bf3fd
PL
130 * @last_retransmitted: sequence number of most recently retransmitted message
131 * @stale_count: # of identical retransmit requests made by peer
a97b9d3f 132 * @rcv_nxt: next sequence number to expect for inbound messages
bc6fecd4 133 * @deferred_queue: deferred queue saved OOS b'cast message received from node
b97bf3fd 134 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer
c637c103
JPM
135 * @inputq: buffer queue for messages to be delivered upwards
136 * @namedq: buffer queue for name table messages to be delivered upwards
b97bf3fd 137 * @next_out: ptr to first unsent outbound message in queue
c637c103 138 * @wakeupq: linked list of wakeup msgs waiting for link congestion to abate
b97bf3fd 139 * @long_msg_seq_no: next identifier to use for outbound fragmented messages
37e22164 140 * @reasm_buf: head of partially reassembled inbound message fragments
b97bf3fd 141 * @stats: collects statistics regarding link activity
b97bf3fd 142 */
a18c4bc3 143struct tipc_link {
b97bf3fd
PL
144 u32 addr;
145 char name[TIPC_MAX_LINK_NAME];
146 struct tipc_media_addr media_addr;
147 struct timer_list timer;
6c00055a 148 struct tipc_node *owner;
2d72d495 149 struct kref ref;
b97bf3fd
PL
150
151 /* Management and link supervision data */
135daee6 152 unsigned int flags;
b97bf3fd
PL
153 u32 peer_session;
154 u32 peer_bearer_id;
7a2f7d18 155 u32 bearer_id;
b97bf3fd 156 u32 tolerance;
a97b9d3f 157 unsigned long keepalive_intv;
b97bf3fd
PL
158 u32 abort_limit;
159 int state;
a97b9d3f 160 u32 silent_intv_cnt;
b97bf3fd
PL
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;
dff29b1a 168 u16 synch_point;
b97bf3fd 169
dff29b1a
JPM
170 /* Failover */
171 u16 failover_pkts;
172 u16 failover_checkpt;
173 struct sk_buff *failover_skb;
b97bf3fd 174
c4307285 175 /* Max packet negotiation */
ed193ece
JPM
176 u16 mtu;
177 u16 advertised_mtu;
b97bf3fd
PL
178
179 /* Sending */
05dcc5aa
JPM
180 struct sk_buff_head transmq;
181 struct sk_buff_head backlogq;
1f66d161
JPM
182 struct {
183 u16 len;
184 u16 limit;
185 } backlog[5];
a97b9d3f
JPM
186 u16 snd_nxt;
187 u16 last_retransm;
05dcc5aa 188 u32 window;
c4307285 189 u32 stale_count;
b97bf3fd
PL
190
191 /* Reception */
a97b9d3f 192 u16 rcv_nxt;
05dcc5aa
JPM
193 u32 rcv_unacked;
194 struct sk_buff_head deferdq;
d39bbd44
JPM
195 struct sk_buff_head *inputq;
196 struct sk_buff_head *namedq;
b97bf3fd
PL
197
198 /* Congestion handling */
c637c103 199 struct sk_buff_head wakeupq;
b97bf3fd 200
40ba3cdf 201 /* Fragmentation/reassembly */
37e22164 202 struct sk_buff *reasm_buf;
b97bf3fd 203
c4307285 204 /* Statistics */
7e9cab58 205 struct tipc_stats stats;
b97bf3fd
PL
206};
207
23dd4cce 208struct tipc_port;
b97bf3fd 209
d39bbd44
JPM
210struct tipc_link *tipc_link_create(struct tipc_node *n,
211 struct tipc_bearer *b,
212 const struct tipc_media_addr *maddr,
213 struct sk_buff_head *inputq,
214 struct sk_buff_head *namedq);
7d24dcdb 215void tipc_link_delete(struct tipc_link *link);
b1c29f6b 216void tipc_link_delete_list(struct net *net, unsigned int bearer_id);
170b3927 217void tipc_link_failover_send_queue(struct tipc_link *l_ptr);
247f0f3c 218void tipc_link_dup_queue_xmit(struct tipc_link *l_ptr, struct tipc_link *dest);
a18c4bc3
PG
219void tipc_link_reset_fragments(struct tipc_link *l_ptr);
220int tipc_link_is_up(struct tipc_link *l_ptr);
221int tipc_link_is_active(struct tipc_link *l_ptr);
581465fa 222void tipc_link_purge_queues(struct tipc_link *l_ptr);
7d967b67 223void tipc_link_purge_backlog(struct tipc_link *l);
3f5a12bd 224void tipc_link_reset_all(struct tipc_node *node);
a18c4bc3 225void tipc_link_reset(struct tipc_link *l_ptr);
7f9f95d9
YX
226int __tipc_link_xmit(struct net *net, struct tipc_link *link,
227 struct sk_buff_head *list);
af9b028e
JPM
228int tipc_link_xmit(struct tipc_link *link, struct sk_buff_head *list,
229 struct sk_buff_head *xmitq);
247f0f3c 230void tipc_link_proto_xmit(struct tipc_link *l_ptr, u32 msg_typ, int prob,
ed193ece 231 u32 gap, u32 tolerance, u32 priority);
47b4c9a8 232void tipc_link_push_packets(struct tipc_link *l_ptr);
bc6fecd4 233u32 tipc_link_defer_pkt(struct sk_buff_head *list, struct sk_buff *buf);
a18c4bc3
PG
234void tipc_link_set_queue_limits(struct tipc_link *l_ptr, u32 window);
235void tipc_link_retransmit(struct tipc_link *l_ptr,
236 struct sk_buff *start, u32 retransmits);
58dc55f2
YX
237struct sk_buff *tipc_skb_queue_next(const struct sk_buff_head *list,
238 const struct sk_buff *skb);
b97bf3fd 239
7be57fc6
RA
240int tipc_nl_link_dump(struct sk_buff *skb, struct netlink_callback *cb);
241int tipc_nl_link_get(struct sk_buff *skb, struct genl_info *info);
f96ce7a2 242int tipc_nl_link_set(struct sk_buff *skb, struct genl_info *info);
ae36342b 243int tipc_nl_link_reset_stats(struct sk_buff *skb, struct genl_info *info);
0655f6a8 244int tipc_nl_parse_link_prop(struct nlattr *prop, struct nlattr *props[]);
c637c103 245void link_prepare_wakeup(struct tipc_link *l);
0655f6a8 246
c5898636
JPM
247static inline u32 link_own_addr(struct tipc_link *l)
248{
249 return msg_prevnode(l->pmsg);
250}
01fee256
AS
251
252/*
253 * Link status checking routines
254 */
a18c4bc3 255static inline int link_working_working(struct tipc_link *l_ptr)
01fee256 256{
a02cec21 257 return l_ptr->state == WORKING_WORKING;
01fee256
AS
258}
259
a18c4bc3 260static inline int link_working_unknown(struct tipc_link *l_ptr)
01fee256 261{
a02cec21 262 return l_ptr->state == WORKING_UNKNOWN;
01fee256
AS
263}
264
a18c4bc3 265static inline int link_reset_unknown(struct tipc_link *l_ptr)
01fee256 266{
a02cec21 267 return l_ptr->state == RESET_UNKNOWN;
01fee256
AS
268}
269
a18c4bc3 270static inline int link_reset_reset(struct tipc_link *l_ptr)
01fee256 271{
a02cec21 272 return l_ptr->state == RESET_RESET;
01fee256
AS
273}
274
b97bf3fd 275#endif