call_event.c 9.6 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11
/* Management of Tx window, Tx resend, ACKs and out-of-sequence reception
 *
 * Copyright (C) 2007 Red Hat, Inc. All Rights Reserved.
 * Written by David Howells (dhowells@redhat.com)
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version
 * 2 of the License, or (at your option) any later version.
 */

12 13
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt

14 15 16 17
#include <linux/module.h>
#include <linux/circ_buf.h>
#include <linux/net.h>
#include <linux/skbuff.h>
18
#include <linux/slab.h>
19 20 21 22 23 24
#include <linux/udp.h>
#include <net/sock.h>
#include <net/af_rxrpc.h>
#include "ar-internal.h"

/*
25
 * Set the timer
26
 */
27 28
void rxrpc_set_timer(struct rxrpc_call *call, enum rxrpc_timer_trace why,
		     ktime_t now)
29
{
30 31
	unsigned long t_j, now_j = jiffies;
	ktime_t t;
32

33
	read_lock_bh(&call->state_lock);
34

35
	if (call->state < RXRPC_CALL_COMPLETE) {
D
David Howells 已提交
36
		t = call->expire_at;
37
		if (!ktime_after(t, now))
D
David Howells 已提交
38 39
			goto out;

40 41
		if (ktime_after(call->resend_at, now) &&
		    ktime_before(call->resend_at, t))
42
			t = call->resend_at;
D
David Howells 已提交
43

44 45
		if (ktime_after(call->ack_at, now) &&
		    ktime_before(call->ack_at, t))
D
David Howells 已提交
46 47
			t = call->ack_at;

48 49 50 51 52 53 54 55 56 57 58 59 60
		t_j = nsecs_to_jiffies(ktime_to_ns(ktime_sub(t, now)));
		t_j += jiffies;

		/* We have to make sure that the calculated jiffies value falls
		 * at or after the nsec value, or we may loop ceaselessly
		 * because the timer times out, but we haven't reached the nsec
		 * timeout yet.
		 */
		t_j++;

		if (call->timer.expires != t_j || !timer_pending(&call->timer)) {
			mod_timer(&call->timer, t_j);
			trace_rxrpc_timer(call, why, now, now_j);
61 62
		}
	}
D
David Howells 已提交
63 64

out:
65 66 67 68
	read_unlock_bh(&call->state_lock);
}

/*
69
 * propose an ACK be sent
70
 */
71 72
static void __rxrpc_propose_ACK(struct rxrpc_call *call, u8 ack_reason,
				u16 skew, u32 serial, bool immediate,
73 74
				bool background,
				enum rxrpc_propose_ack_trace why)
75
{
76
	enum rxrpc_propose_ack_outcome outcome = rxrpc_propose_ack_use;
77 78
	unsigned int expiry = rxrpc_soft_ack_delay;
	ktime_t now, ack_at;
79 80
	s8 prior = rxrpc_ack_priority[ack_reason];

81 82 83 84 85 86 87 88
	/* Update DELAY, IDLE, REQUESTED and PING_RESPONSE ACK serial
	 * numbers, but we don't alter the timeout.
	 */
	_debug("prior %u %u vs %u %u",
	       ack_reason, prior,
	       call->ackr_reason, rxrpc_ack_priority[call->ackr_reason]);
	if (ack_reason == call->ackr_reason) {
		if (RXRPC_ACK_UPDATEABLE & (1 << ack_reason)) {
89
			outcome = rxrpc_propose_ack_update;
90 91
			call->ackr_serial = serial;
			call->ackr_skew = skew;
92
		}
93
		if (!immediate)
94
			goto trace;
95 96 97 98
	} else if (prior > rxrpc_ack_priority[call->ackr_reason]) {
		call->ackr_reason = ack_reason;
		call->ackr_serial = serial;
		call->ackr_skew = skew;
99 100
	} else {
		outcome = rxrpc_propose_ack_subsume;
101 102
	}

103 104 105 106 107 108 109
	switch (ack_reason) {
	case RXRPC_ACK_REQUESTED:
		if (rxrpc_requested_ack_delay < expiry)
			expiry = rxrpc_requested_ack_delay;
		if (serial == 1)
			immediate = false;
		break;
110

111 112 113 114
	case RXRPC_ACK_DELAY:
		if (rxrpc_soft_ack_delay < expiry)
			expiry = rxrpc_soft_ack_delay;
		break;
115

116
	case RXRPC_ACK_PING:
117
	case RXRPC_ACK_IDLE:
118
		if (rxrpc_idle_ack_delay < expiry)
119 120
			expiry = rxrpc_idle_ack_delay;
		break;
121

122 123 124
	default:
		immediate = true;
		break;
125 126
	}

127 128 129 130 131 132 133 134
	if (test_bit(RXRPC_CALL_EV_ACK, &call->events)) {
		_debug("already scheduled");
	} else if (immediate || expiry == 0) {
		_debug("immediate ACK %lx", call->events);
		if (!test_and_set_bit(RXRPC_CALL_EV_ACK, &call->events) &&
		    background)
			rxrpc_queue_call(call);
	} else {
135 136 137
		now = ktime_get_real();
		ack_at = ktime_add_ms(now, expiry);
		if (ktime_before(ack_at, call->ack_at)) {
138
			call->ack_at = ack_at;
139
			rxrpc_set_timer(call, rxrpc_timer_set_for_ack, now);
140 141
		}
	}
142 143 144 145

trace:
	trace_rxrpc_propose_ack(call, why, ack_reason, serial, immediate,
				background, outcome);
146 147 148
}

/*
149
 * propose an ACK be sent, locking the call structure
150
 */
151
void rxrpc_propose_ACK(struct rxrpc_call *call, u8 ack_reason,
152 153
		       u16 skew, u32 serial, bool immediate, bool background,
		       enum rxrpc_propose_ack_trace why)
154
{
155 156
	spin_lock_bh(&call->lock);
	__rxrpc_propose_ACK(call, ack_reason, skew, serial,
157
			    immediate, background, why);
158
	spin_unlock_bh(&call->lock);
159 160
}

D
David Howells 已提交
161 162 163 164 165 166 167 168
/*
 * Handle congestion being detected by the retransmit timeout.
 */
static void rxrpc_congestion_timeout(struct rxrpc_call *call)
{
	set_bit(RXRPC_CALL_RETRANS_TIMEOUT, &call->flags);
}

169
/*
170
 * Perform retransmission of NAK'd and unack'd packets.
171
 */
172
static void rxrpc_resend(struct rxrpc_call *call, ktime_t now)
173 174 175
{
	struct rxrpc_skb_priv *sp;
	struct sk_buff *skb;
176
	rxrpc_seq_t cursor, seq, top;
177
	ktime_t max_age, oldest, ack_ts;
178
	int ix;
D
David Howells 已提交
179
	u8 annotation, anno_type, retrans = 0, unacked = 0;
180

181
	_enter("{%d,%d}", call->tx_hard_ack, call->tx_top);
182

183 184
	max_age = ktime_sub_ms(now, rxrpc_resend_timeout);

185 186
	spin_lock_bh(&call->lock);

187 188 189 190 191 192 193 194 195 196
	cursor = call->tx_hard_ack;
	top = call->tx_top;
	ASSERT(before_eq(cursor, top));
	if (cursor == top)
		goto out_unlock;

	/* Scan the packet list without dropping the lock and decide which of
	 * the packets in the Tx buffer we're going to resend and what the new
	 * resend timeout will be.
	 */
197
	oldest = now;
198
	for (seq = cursor + 1; before_eq(seq, top); seq++) {
199 200
		ix = seq & RXRPC_RXTX_BUFF_MASK;
		annotation = call->rxtx_annotations[ix];
D
David Howells 已提交
201 202 203
		anno_type = annotation & RXRPC_TX_ANNO_MASK;
		annotation &= ~RXRPC_TX_ANNO_MASK;
		if (anno_type == RXRPC_TX_ANNO_ACK)
204
			continue;
205

206
		skb = call->rxtx_buffer[ix];
D
David Howells 已提交
207
		rxrpc_see_skb(skb, rxrpc_skb_tx_seen);
208 209
		sp = rxrpc_skb(skb);

D
David Howells 已提交
210
		if (anno_type == RXRPC_TX_ANNO_UNACK) {
211 212 213
			if (ktime_after(skb->tstamp, max_age)) {
				if (ktime_before(skb->tstamp, oldest))
					oldest = skb->tstamp;
214
				continue;
215
			}
D
David Howells 已提交
216 217
			if (!(annotation & RXRPC_TX_ANNO_RESENT))
				unacked++;
218 219
		}

220
		/* Okay, we need to retransmit a packet. */
D
David Howells 已提交
221
		call->rxtx_annotations[ix] = RXRPC_TX_ANNO_RETRANS | annotation;
D
David Howells 已提交
222
		retrans++;
223 224
		trace_rxrpc_retransmit(call, seq, annotation | anno_type,
				       ktime_to_ns(ktime_sub(skb->tstamp, max_age)));
225
	}
226

227
	call->resend_at = ktime_add_ms(oldest, rxrpc_resend_timeout);
228

D
David Howells 已提交
229 230 231 232 233 234 235 236
	if (unacked)
		rxrpc_congestion_timeout(call);

	/* If there was nothing that needed retransmission then it's likely
	 * that an ACK got lost somewhere.  Send a ping to find out instead of
	 * retransmitting data.
	 */
	if (!retrans) {
237
		rxrpc_set_timer(call, rxrpc_timer_set_for_resend, now);
D
David Howells 已提交
238 239 240 241 242 243 244 245 246 247
		spin_unlock_bh(&call->lock);
		ack_ts = ktime_sub(now, call->acks_latest_ts);
		if (ktime_to_ns(ack_ts) < call->peer->rtt)
			goto out;
		rxrpc_propose_ACK(call, RXRPC_ACK_PING, 0, 0, true, false,
				  rxrpc_propose_ack_ping_for_lost_ack);
		rxrpc_send_call_packet(call, RXRPC_PACKET_TYPE_ACK);
		goto out;
	}

248 249 250 251 252
	/* Now go through the Tx window and perform the retransmissions.  We
	 * have to drop the lock for each send.  If an ACK comes in whilst the
	 * lock is dropped, it may clear some of the retransmission markers for
	 * packets that it soft-ACKs.
	 */
253
	for (seq = cursor + 1; before_eq(seq, top); seq++) {
254 255
		ix = seq & RXRPC_RXTX_BUFF_MASK;
		annotation = call->rxtx_annotations[ix];
D
David Howells 已提交
256 257
		anno_type = annotation & RXRPC_TX_ANNO_MASK;
		if (anno_type != RXRPC_TX_ANNO_RETRANS)
258
			continue;
259

260
		skb = call->rxtx_buffer[ix];
D
David Howells 已提交
261
		rxrpc_get_skb(skb, rxrpc_skb_tx_got);
262 263
		spin_unlock_bh(&call->lock);

264
		if (rxrpc_send_data_packet(call, skb, true) < 0) {
D
David Howells 已提交
265
			rxrpc_free_skb(skb, rxrpc_skb_tx_freed);
266 267
			return;
		}
268

269 270
		if (rxrpc_is_client_call(call))
			rxrpc_expose_client_call(call);
271

D
David Howells 已提交
272
		rxrpc_free_skb(skb, rxrpc_skb_tx_freed);
273 274
		spin_lock_bh(&call->lock);

275 276 277 278 279
		/* We need to clear the retransmit state, but there are two
		 * things we need to be aware of: A new ACK/NAK might have been
		 * received and the packet might have been hard-ACK'd (in which
		 * case it will no longer be in the buffer).
		 */
D
David Howells 已提交
280 281 282 283 284 285 286 287 288 289 290
		if (after(seq, call->tx_hard_ack)) {
			annotation = call->rxtx_annotations[ix];
			anno_type = annotation & RXRPC_TX_ANNO_MASK;
			if (anno_type == RXRPC_TX_ANNO_RETRANS ||
			    anno_type == RXRPC_TX_ANNO_NAK) {
				annotation &= ~RXRPC_TX_ANNO_MASK;
				annotation |= RXRPC_TX_ANNO_UNACK;
			}
			annotation |= RXRPC_TX_ANNO_RESENT;
			call->rxtx_annotations[ix] = annotation;
		}
291 292 293

		if (after(call->tx_hard_ack, seq))
			seq = call->tx_hard_ack;
294
	}
295 296 297

out_unlock:
	spin_unlock_bh(&call->lock);
D
David Howells 已提交
298
out:
299
	_leave("");
300 301 302
}

/*
303
 * Handle retransmission and deferred ACK/abort generation.
304 305 306 307 308
 */
void rxrpc_process_call(struct work_struct *work)
{
	struct rxrpc_call *call =
		container_of(work, struct rxrpc_call, processor);
309
	ktime_t now;
310

D
David Howells 已提交
311 312
	rxrpc_see_call(call);

313
	//printk("\n--------------------\n");
314 315
	_enter("{%d,%s,%lx}",
	       call->debug_id, rxrpc_call_states[call->state], call->events);
316

317 318 319 320
recheck_state:
	if (test_and_clear_bit(RXRPC_CALL_EV_ABORT, &call->events)) {
		rxrpc_send_call_packet(call, RXRPC_PACKET_TYPE_ABORT);
		goto recheck_state;
321 322
	}

323 324 325
	if (call->state == RXRPC_CALL_COMPLETE) {
		del_timer_sync(&call->timer);
		goto out_put;
326 327
	}

328 329
	now = ktime_get_real();
	if (ktime_before(call->expire_at, now)) {
330
		rxrpc_abort_call("EXP", call, 0, RX_CALL_TIMEOUT, ETIME);
331
		set_bit(RXRPC_CALL_EV_ABORT, &call->events);
D
David Howells 已提交
332
		goto recheck_state;
333 334
	}

335
	if (test_and_clear_bit(RXRPC_CALL_EV_ACK, &call->events) ||
336
	    ktime_before(call->ack_at, now)) {
337 338 339 340
		call->ack_at = call->expire_at;
		if (call->ackr_reason) {
			rxrpc_send_call_packet(call, RXRPC_PACKET_TYPE_ACK);
			goto recheck_state;
341 342 343
		}
	}

344
	if (test_and_clear_bit(RXRPC_CALL_EV_RESEND, &call->events) ||
345 346
	    ktime_before(call->resend_at, now)) {
		rxrpc_resend(call, now);
347
		goto recheck_state;
348 349
	}

350
	rxrpc_set_timer(call, rxrpc_timer_set_for_resend, now);
351 352

	/* other events may have been raised since we started checking */
353
	if (call->events && call->state < RXRPC_CALL_COMPLETE) {
354
		__rxrpc_queue_call(call);
355
		goto out;
356 357
	}

358 359 360
out_put:
	rxrpc_put_call(call, rxrpc_call_put);
out:
361 362
	_leave("");
}