Loading...
1/*
2 * net/tipc/link.h: Include file for TIPC link code
3 *
4 * Copyright (c) 1995-2006, Ericsson AB
5 * Copyright (c) 2004-2005, 2010-2011, Wind River Systems
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
10 *
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.
19 *
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
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#ifndef _TIPC_LINK_H
38#define _TIPC_LINK_H
39
40#include "log.h"
41#include "msg.h"
42#include "node.h"
43
44#define PUSH_FAILED 1
45#define PUSH_FINISHED 2
46
47/*
48 * Link states
49 */
50
51#define WORKING_WORKING 560810u
52#define WORKING_UNKNOWN 560811u
53#define RESET_UNKNOWN 560812u
54#define RESET_RESET 560813u
55
56/*
57 * Starting value for maximum packet size negotiation on unicast links
58 * (unless bearer MTU is less)
59 */
60
61#define MAX_PKT_DEFAULT 1500
62
63/**
64 * struct link - TIPC link data structure
65 * @addr: network address of link's peer node
66 * @name: link name character string
67 * @media_addr: media address to use when sending messages over link
68 * @timer: link timer
69 * @owner: pointer to peer node
70 * @link_list: adjacent links in bearer's list of links
71 * @started: indicates if link has been started
72 * @checkpoint: reference point for triggering link continuity checking
73 * @peer_session: link session # being used by peer end of link
74 * @peer_bearer_id: bearer id used by link's peer endpoint
75 * @b_ptr: pointer to bearer used by link
76 * @tolerance: minimum link continuity loss needed to reset link [in ms]
77 * @continuity_interval: link continuity testing interval [in ms]
78 * @abort_limit: # of unacknowledged continuity probes needed to reset link
79 * @state: current state of link FSM
80 * @blocked: indicates if link has been administratively blocked
81 * @fsm_msg_cnt: # of protocol messages link FSM has sent in current state
82 * @proto_msg: template for control messages generated by link
83 * @pmsg: convenience pointer to "proto_msg" field
84 * @priority: current link priority
85 * @queue_limit: outbound message queue congestion thresholds (indexed by user)
86 * @exp_msg_count: # of tunnelled messages expected during link changeover
87 * @reset_checkpoint: seq # of last acknowledged message at time of link reset
88 * @max_pkt: current maximum packet size for this link
89 * @max_pkt_target: desired maximum packet size for this link
90 * @max_pkt_probes: # of probes based on current (max_pkt, max_pkt_target)
91 * @out_queue_size: # of messages in outbound message queue
92 * @first_out: ptr to first outbound message in queue
93 * @last_out: ptr to last outbound message in queue
94 * @next_out_no: next sequence number to use for outbound messages
95 * @last_retransmitted: sequence number of most recently retransmitted message
96 * @stale_count: # of identical retransmit requests made by peer
97 * @next_in_no: next sequence number to expect for inbound messages
98 * @deferred_inqueue_sz: # of messages in inbound message queue
99 * @oldest_deferred_in: ptr to first inbound message in queue
100 * @newest_deferred_in: ptr to last inbound message in queue
101 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer
102 * @proto_msg_queue: ptr to (single) outbound control message
103 * @retransm_queue_size: number of messages to retransmit
104 * @retransm_queue_head: sequence number of first message to retransmit
105 * @next_out: ptr to first unsent outbound message in queue
106 * @waiting_ports: linked list of ports waiting for link congestion to abate
107 * @long_msg_seq_no: next identifier to use for outbound fragmented messages
108 * @defragm_buf: list of partially reassembled inbound message fragments
109 * @stats: collects statistics regarding link activity
110 */
111
112struct link {
113 u32 addr;
114 char name[TIPC_MAX_LINK_NAME];
115 struct tipc_media_addr media_addr;
116 struct timer_list timer;
117 struct tipc_node *owner;
118 struct list_head link_list;
119
120 /* Management and link supervision data */
121 int started;
122 u32 checkpoint;
123 u32 peer_session;
124 u32 peer_bearer_id;
125 struct tipc_bearer *b_ptr;
126 u32 tolerance;
127 u32 continuity_interval;
128 u32 abort_limit;
129 int state;
130 int blocked;
131 u32 fsm_msg_cnt;
132 struct {
133 unchar hdr[INT_H_SIZE];
134 unchar body[TIPC_MAX_IF_NAME];
135 } proto_msg;
136 struct tipc_msg *pmsg;
137 u32 priority;
138 u32 queue_limit[15]; /* queue_limit[0]==window limit */
139
140 /* Changeover */
141 u32 exp_msg_count;
142 u32 reset_checkpoint;
143
144 /* Max packet negotiation */
145 u32 max_pkt;
146 u32 max_pkt_target;
147 u32 max_pkt_probes;
148
149 /* Sending */
150 u32 out_queue_size;
151 struct sk_buff *first_out;
152 struct sk_buff *last_out;
153 u32 next_out_no;
154 u32 last_retransmitted;
155 u32 stale_count;
156
157 /* Reception */
158 u32 next_in_no;
159 u32 deferred_inqueue_sz;
160 struct sk_buff *oldest_deferred_in;
161 struct sk_buff *newest_deferred_in;
162 u32 unacked_window;
163
164 /* Congestion handling */
165 struct sk_buff *proto_msg_queue;
166 u32 retransm_queue_size;
167 u32 retransm_queue_head;
168 struct sk_buff *next_out;
169 struct list_head waiting_ports;
170
171 /* Fragmentation/defragmentation */
172 u32 long_msg_seq_no;
173 struct sk_buff *defragm_buf;
174
175 /* Statistics */
176 struct {
177 u32 sent_info; /* used in counting # sent packets */
178 u32 recv_info; /* used in counting # recv'd packets */
179 u32 sent_states;
180 u32 recv_states;
181 u32 sent_probes;
182 u32 recv_probes;
183 u32 sent_nacks;
184 u32 recv_nacks;
185 u32 sent_acks;
186 u32 sent_bundled;
187 u32 sent_bundles;
188 u32 recv_bundled;
189 u32 recv_bundles;
190 u32 retransmitted;
191 u32 sent_fragmented;
192 u32 sent_fragments;
193 u32 recv_fragmented;
194 u32 recv_fragments;
195 u32 link_congs; /* # port sends blocked by congestion */
196 u32 bearer_congs;
197 u32 deferred_recv;
198 u32 duplicates;
199 u32 max_queue_sz; /* send queue size high water mark */
200 u32 accu_queue_sz; /* used for send queue size profiling */
201 u32 queue_sz_counts; /* used for send queue size profiling */
202 u32 msg_length_counts; /* used for message length profiling */
203 u32 msg_lengths_total; /* used for message length profiling */
204 u32 msg_length_profile[7]; /* used for msg. length profiling */
205 } stats;
206};
207
208struct tipc_port;
209
210struct link *tipc_link_create(struct tipc_node *n_ptr,
211 struct tipc_bearer *b_ptr,
212 const struct tipc_media_addr *media_addr);
213void tipc_link_delete(struct link *l_ptr);
214void tipc_link_changeover(struct link *l_ptr);
215void tipc_link_send_duplicate(struct link *l_ptr, struct link *dest);
216void tipc_link_reset_fragments(struct link *l_ptr);
217int tipc_link_is_up(struct link *l_ptr);
218int tipc_link_is_active(struct link *l_ptr);
219u32 tipc_link_push_packet(struct link *l_ptr);
220void tipc_link_stop(struct link *l_ptr);
221struct sk_buff *tipc_link_cmd_config(const void *req_tlv_area, int req_tlv_space, u16 cmd);
222struct sk_buff *tipc_link_cmd_show_stats(const void *req_tlv_area, int req_tlv_space);
223struct sk_buff *tipc_link_cmd_reset_stats(const void *req_tlv_area, int req_tlv_space);
224void tipc_link_reset(struct link *l_ptr);
225int tipc_link_send(struct sk_buff *buf, u32 dest, u32 selector);
226int tipc_link_send_buf(struct link *l_ptr, struct sk_buff *buf);
227u32 tipc_link_get_max_pkt(u32 dest, u32 selector);
228int tipc_link_send_sections_fast(struct tipc_port *sender,
229 struct iovec const *msg_sect,
230 const u32 num_sect,
231 unsigned int total_len,
232 u32 destnode);
233void tipc_link_recv_bundle(struct sk_buff *buf);
234int tipc_link_recv_fragment(struct sk_buff **pending,
235 struct sk_buff **fb,
236 struct tipc_msg **msg);
237void tipc_link_send_proto_msg(struct link *l_ptr, u32 msg_typ, int prob, u32 gap,
238 u32 tolerance, u32 priority, u32 acked_mtu);
239void tipc_link_push_queue(struct link *l_ptr);
240u32 tipc_link_defer_pkt(struct sk_buff **head, struct sk_buff **tail,
241 struct sk_buff *buf);
242void tipc_link_wakeup_ports(struct link *l_ptr, int all);
243void tipc_link_set_queue_limits(struct link *l_ptr, u32 window);
244void tipc_link_retransmit(struct link *l_ptr, struct sk_buff *start, u32 retransmits);
245
246/*
247 * Link sequence number manipulation routines (uses modulo 2**16 arithmetic)
248 */
249
250static inline u32 mod(u32 x)
251{
252 return x & 0xffffu;
253}
254
255static inline int between(u32 lower, u32 upper, u32 n)
256{
257 if ((lower < n) && (n < upper))
258 return 1;
259 if ((upper < lower) && ((n > lower) || (n < upper)))
260 return 1;
261 return 0;
262}
263
264static inline int less_eq(u32 left, u32 right)
265{
266 return mod(right - left) < 32768u;
267}
268
269static inline int less(u32 left, u32 right)
270{
271 return less_eq(left, right) && (mod(right) != mod(left));
272}
273
274static inline u32 lesser(u32 left, u32 right)
275{
276 return less_eq(left, right) ? left : right;
277}
278
279
280/*
281 * Link status checking routines
282 */
283
284static inline int link_working_working(struct link *l_ptr)
285{
286 return l_ptr->state == WORKING_WORKING;
287}
288
289static inline int link_working_unknown(struct link *l_ptr)
290{
291 return l_ptr->state == WORKING_UNKNOWN;
292}
293
294static inline int link_reset_unknown(struct link *l_ptr)
295{
296 return l_ptr->state == RESET_UNKNOWN;
297}
298
299static inline int link_reset_reset(struct link *l_ptr)
300{
301 return l_ptr->state == RESET_RESET;
302}
303
304static inline int link_blocked(struct link *l_ptr)
305{
306 return l_ptr->exp_msg_count || l_ptr->blocked;
307}
308
309static inline int link_congested(struct link *l_ptr)
310{
311 return l_ptr->out_queue_size >= l_ptr->queue_limit[0];
312}
313
314#endif
1/*
2 * net/tipc/link.h: Include file for TIPC link code
3 *
4 * Copyright (c) 1995-2006, Ericsson AB
5 * Copyright (c) 2004-2005, 2010-2011, Wind River Systems
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are met:
10 *
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.
19 *
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
34 * POSSIBILITY OF SUCH DAMAGE.
35 */
36
37#ifndef _TIPC_LINK_H
38#define _TIPC_LINK_H
39
40#include "log.h"
41#include "msg.h"
42#include "node.h"
43
44#define PUSH_FAILED 1
45#define PUSH_FINISHED 2
46
47/*
48 * Out-of-range value for link sequence numbers
49 */
50#define INVALID_LINK_SEQ 0x10000
51
52/*
53 * Link states
54 */
55#define WORKING_WORKING 560810u
56#define WORKING_UNKNOWN 560811u
57#define RESET_UNKNOWN 560812u
58#define RESET_RESET 560813u
59
60/*
61 * Starting value for maximum packet size negotiation on unicast links
62 * (unless bearer MTU is less)
63 */
64#define MAX_PKT_DEFAULT 1500
65
66/**
67 * struct tipc_link - TIPC link data structure
68 * @addr: network address of link's peer node
69 * @name: link name character string
70 * @media_addr: media address to use when sending messages over link
71 * @timer: link timer
72 * @owner: pointer to peer node
73 * @link_list: adjacent links in bearer's list of links
74 * @started: indicates if link has been started
75 * @checkpoint: reference point for triggering link continuity checking
76 * @peer_session: link session # being used by peer end of link
77 * @peer_bearer_id: bearer id used by link's peer endpoint
78 * @b_ptr: pointer to bearer used by link
79 * @tolerance: minimum link continuity loss needed to reset link [in ms]
80 * @continuity_interval: link continuity testing interval [in ms]
81 * @abort_limit: # of unacknowledged continuity probes needed to reset link
82 * @state: current state of link FSM
83 * @blocked: indicates if link has been administratively blocked
84 * @fsm_msg_cnt: # of protocol messages link FSM has sent in current state
85 * @proto_msg: template for control messages generated by link
86 * @pmsg: convenience pointer to "proto_msg" field
87 * @priority: current link priority
88 * @queue_limit: outbound message queue congestion thresholds (indexed by user)
89 * @exp_msg_count: # of tunnelled messages expected during link changeover
90 * @reset_checkpoint: seq # of last acknowledged message at time of link reset
91 * @max_pkt: current maximum packet size for this link
92 * @max_pkt_target: desired maximum packet size for this link
93 * @max_pkt_probes: # of probes based on current (max_pkt, max_pkt_target)
94 * @out_queue_size: # of messages in outbound message queue
95 * @first_out: ptr to first outbound message in queue
96 * @last_out: ptr to last outbound message in queue
97 * @next_out_no: next sequence number to use for outbound messages
98 * @last_retransmitted: sequence number of most recently retransmitted message
99 * @stale_count: # of identical retransmit requests made by peer
100 * @next_in_no: next sequence number to expect for inbound messages
101 * @deferred_inqueue_sz: # of messages in inbound message queue
102 * @oldest_deferred_in: ptr to first inbound message in queue
103 * @newest_deferred_in: ptr to last inbound message in queue
104 * @unacked_window: # of inbound messages rx'd without ack'ing back to peer
105 * @proto_msg_queue: ptr to (single) outbound control message
106 * @retransm_queue_size: number of messages to retransmit
107 * @retransm_queue_head: sequence number of first message to retransmit
108 * @next_out: ptr to first unsent outbound message in queue
109 * @waiting_ports: linked list of ports waiting for link congestion to abate
110 * @long_msg_seq_no: next identifier to use for outbound fragmented messages
111 * @defragm_buf: list of partially reassembled inbound message fragments
112 * @stats: collects statistics regarding link activity
113 */
114struct tipc_link {
115 u32 addr;
116 char name[TIPC_MAX_LINK_NAME];
117 struct tipc_media_addr media_addr;
118 struct timer_list timer;
119 struct tipc_node *owner;
120 struct list_head link_list;
121
122 /* Management and link supervision data */
123 int started;
124 u32 checkpoint;
125 u32 peer_session;
126 u32 peer_bearer_id;
127 struct tipc_bearer *b_ptr;
128 u32 tolerance;
129 u32 continuity_interval;
130 u32 abort_limit;
131 int state;
132 int blocked;
133 u32 fsm_msg_cnt;
134 struct {
135 unchar hdr[INT_H_SIZE];
136 unchar body[TIPC_MAX_IF_NAME];
137 } proto_msg;
138 struct tipc_msg *pmsg;
139 u32 priority;
140 u32 queue_limit[15]; /* queue_limit[0]==window limit */
141
142 /* Changeover */
143 u32 exp_msg_count;
144 u32 reset_checkpoint;
145
146 /* Max packet negotiation */
147 u32 max_pkt;
148 u32 max_pkt_target;
149 u32 max_pkt_probes;
150
151 /* Sending */
152 u32 out_queue_size;
153 struct sk_buff *first_out;
154 struct sk_buff *last_out;
155 u32 next_out_no;
156 u32 last_retransmitted;
157 u32 stale_count;
158
159 /* Reception */
160 u32 next_in_no;
161 u32 deferred_inqueue_sz;
162 struct sk_buff *oldest_deferred_in;
163 struct sk_buff *newest_deferred_in;
164 u32 unacked_window;
165
166 /* Congestion handling */
167 struct sk_buff *proto_msg_queue;
168 u32 retransm_queue_size;
169 u32 retransm_queue_head;
170 struct sk_buff *next_out;
171 struct list_head waiting_ports;
172
173 /* Fragmentation/defragmentation */
174 u32 long_msg_seq_no;
175 struct sk_buff *defragm_buf;
176
177 /* Statistics */
178 struct {
179 u32 sent_info; /* used in counting # sent packets */
180 u32 recv_info; /* used in counting # recv'd packets */
181 u32 sent_states;
182 u32 recv_states;
183 u32 sent_probes;
184 u32 recv_probes;
185 u32 sent_nacks;
186 u32 recv_nacks;
187 u32 sent_acks;
188 u32 sent_bundled;
189 u32 sent_bundles;
190 u32 recv_bundled;
191 u32 recv_bundles;
192 u32 retransmitted;
193 u32 sent_fragmented;
194 u32 sent_fragments;
195 u32 recv_fragmented;
196 u32 recv_fragments;
197 u32 link_congs; /* # port sends blocked by congestion */
198 u32 bearer_congs;
199 u32 deferred_recv;
200 u32 duplicates;
201 u32 max_queue_sz; /* send queue size high water mark */
202 u32 accu_queue_sz; /* used for send queue size profiling */
203 u32 queue_sz_counts; /* used for send queue size profiling */
204 u32 msg_length_counts; /* used for message length profiling */
205 u32 msg_lengths_total; /* used for message length profiling */
206 u32 msg_length_profile[7]; /* used for msg. length profiling */
207 } stats;
208};
209
210struct tipc_port;
211
212struct tipc_link *tipc_link_create(struct tipc_node *n_ptr,
213 struct tipc_bearer *b_ptr,
214 const struct tipc_media_addr *media_addr);
215void tipc_link_delete(struct tipc_link *l_ptr);
216void tipc_link_changeover(struct tipc_link *l_ptr);
217void tipc_link_send_duplicate(struct tipc_link *l_ptr, struct tipc_link *dest);
218void tipc_link_reset_fragments(struct tipc_link *l_ptr);
219int tipc_link_is_up(struct tipc_link *l_ptr);
220int tipc_link_is_active(struct tipc_link *l_ptr);
221u32 tipc_link_push_packet(struct tipc_link *l_ptr);
222void tipc_link_stop(struct tipc_link *l_ptr);
223struct sk_buff *tipc_link_cmd_config(const void *req_tlv_area, int req_tlv_space, u16 cmd);
224struct sk_buff *tipc_link_cmd_show_stats(const void *req_tlv_area, int req_tlv_space);
225struct sk_buff *tipc_link_cmd_reset_stats(const void *req_tlv_area, int req_tlv_space);
226void tipc_link_reset(struct tipc_link *l_ptr);
227int tipc_link_send(struct sk_buff *buf, u32 dest, u32 selector);
228void tipc_link_send_names(struct list_head *message_list, u32 dest);
229int tipc_link_send_buf(struct tipc_link *l_ptr, struct sk_buff *buf);
230u32 tipc_link_get_max_pkt(u32 dest, u32 selector);
231int tipc_link_send_sections_fast(struct tipc_port *sender,
232 struct iovec const *msg_sect,
233 const u32 num_sect,
234 unsigned int total_len,
235 u32 destnode);
236void tipc_link_recv_bundle(struct sk_buff *buf);
237int tipc_link_recv_fragment(struct sk_buff **pending,
238 struct sk_buff **fb,
239 struct tipc_msg **msg);
240void tipc_link_send_proto_msg(struct tipc_link *l_ptr, u32 msg_typ, int prob,
241 u32 gap, u32 tolerance, u32 priority,
242 u32 acked_mtu);
243void tipc_link_push_queue(struct tipc_link *l_ptr);
244u32 tipc_link_defer_pkt(struct sk_buff **head, struct sk_buff **tail,
245 struct sk_buff *buf);
246void tipc_link_wakeup_ports(struct tipc_link *l_ptr, int all);
247void tipc_link_set_queue_limits(struct tipc_link *l_ptr, u32 window);
248void tipc_link_retransmit(struct tipc_link *l_ptr,
249 struct sk_buff *start, u32 retransmits);
250
251/*
252 * Link sequence number manipulation routines (uses modulo 2**16 arithmetic)
253 */
254static inline u32 buf_seqno(struct sk_buff *buf)
255{
256 return msg_seqno(buf_msg(buf));
257}
258
259static inline u32 mod(u32 x)
260{
261 return x & 0xffffu;
262}
263
264static inline int between(u32 lower, u32 upper, u32 n)
265{
266 if ((lower < n) && (n < upper))
267 return 1;
268 if ((upper < lower) && ((n > lower) || (n < upper)))
269 return 1;
270 return 0;
271}
272
273static inline int less_eq(u32 left, u32 right)
274{
275 return mod(right - left) < 32768u;
276}
277
278static inline int less(u32 left, u32 right)
279{
280 return less_eq(left, right) && (mod(right) != mod(left));
281}
282
283static inline u32 lesser(u32 left, u32 right)
284{
285 return less_eq(left, right) ? left : right;
286}
287
288
289/*
290 * Link status checking routines
291 */
292static inline int link_working_working(struct tipc_link *l_ptr)
293{
294 return l_ptr->state == WORKING_WORKING;
295}
296
297static inline int link_working_unknown(struct tipc_link *l_ptr)
298{
299 return l_ptr->state == WORKING_UNKNOWN;
300}
301
302static inline int link_reset_unknown(struct tipc_link *l_ptr)
303{
304 return l_ptr->state == RESET_UNKNOWN;
305}
306
307static inline int link_reset_reset(struct tipc_link *l_ptr)
308{
309 return l_ptr->state == RESET_RESET;
310}
311
312static inline int link_blocked(struct tipc_link *l_ptr)
313{
314 return l_ptr->exp_msg_count || l_ptr->blocked;
315}
316
317static inline int link_congested(struct tipc_link *l_ptr)
318{
319 return l_ptr->out_queue_size >= l_ptr->queue_limit[0];
320}
321
322#endif