2006-03-21 02:41:47 +01:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2005, 2006 Andrea Bittau <a.bittau@cs.ucl.ac.uk>
|
|
|
|
*
|
|
|
|
* Changes to meet Linux coding standards, and DCCP infrastructure fixes.
|
|
|
|
*
|
|
|
|
* Copyright (c) 2006 Arnaldo Carvalho de Melo <acme@conectiva.com.br>
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
2006-10-25 01:17:51 +02:00
|
|
|
* This implementation should follow RFC 4341
|
2006-03-21 02:41:47 +01:00
|
|
|
*/
|
2008-11-12 09:43:40 +01:00
|
|
|
#include "../feat.h"
|
2006-03-21 02:41:47 +01:00
|
|
|
#include "../ccid.h"
|
|
|
|
#include "../dccp.h"
|
|
|
|
#include "ccid2.h"
|
|
|
|
|
|
|
|
|
2006-09-19 22:12:44 +02:00
|
|
|
#ifdef CONFIG_IP_DCCP_CCID2_DEBUG
|
2006-11-20 21:26:03 +01:00
|
|
|
static int ccid2_debug;
|
|
|
|
#define ccid2_pr_debug(format, a...) DCCP_PR_DEBUG(ccid2_debug, format, ##a)
|
2008-09-09 13:27:22 +02:00
|
|
|
|
|
|
|
static void ccid2_hc_tx_check_sanity(const struct ccid2_hc_tx_sock *hctx)
|
|
|
|
{
|
|
|
|
int len = 0;
|
|
|
|
int pipe = 0;
|
2009-10-05 02:53:10 +02:00
|
|
|
struct ccid2_seq *seqp = hctx->tx_seqh;
|
2008-09-09 13:27:22 +02:00
|
|
|
|
|
|
|
/* there is data in the chain */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (seqp != hctx->tx_seqt) {
|
2008-09-09 13:27:22 +02:00
|
|
|
seqp = seqp->ccid2s_prev;
|
|
|
|
len++;
|
|
|
|
if (!seqp->ccid2s_acked)
|
|
|
|
pipe++;
|
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
while (seqp != hctx->tx_seqt) {
|
2008-09-09 13:27:22 +02:00
|
|
|
struct ccid2_seq *prev = seqp->ccid2s_prev;
|
|
|
|
|
|
|
|
len++;
|
|
|
|
if (!prev->ccid2s_acked)
|
|
|
|
pipe++;
|
|
|
|
|
|
|
|
/* packets are sent sequentially */
|
|
|
|
BUG_ON(dccp_delta_seqno(seqp->ccid2s_seq,
|
|
|
|
prev->ccid2s_seq ) >= 0);
|
|
|
|
BUG_ON(time_before(seqp->ccid2s_sent,
|
|
|
|
prev->ccid2s_sent));
|
|
|
|
|
|
|
|
seqp = prev;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
BUG_ON(pipe != hctx->tx_pipe);
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_pr_debug("len of chain=%d\n", len);
|
|
|
|
|
|
|
|
do {
|
|
|
|
seqp = seqp->ccid2s_prev;
|
|
|
|
len++;
|
2009-10-05 02:53:10 +02:00
|
|
|
} while (seqp != hctx->tx_seqh);
|
2008-09-09 13:27:22 +02:00
|
|
|
|
|
|
|
ccid2_pr_debug("total len=%d\n", len);
|
2009-10-05 02:53:10 +02:00
|
|
|
BUG_ON(len != hctx->tx_seqbufc * CCID2_SEQBUF_LEN);
|
2008-09-09 13:27:22 +02:00
|
|
|
}
|
2006-03-21 02:41:47 +01:00
|
|
|
#else
|
2006-11-20 21:26:03 +01:00
|
|
|
#define ccid2_pr_debug(format, a...)
|
2008-09-09 13:27:22 +02:00
|
|
|
#define ccid2_hc_tx_check_sanity(hctx)
|
2006-03-21 02:41:47 +01:00
|
|
|
#endif
|
|
|
|
|
2007-10-04 23:41:00 +02:00
|
|
|
static int ccid2_hc_tx_alloc_seq(struct ccid2_hc_tx_sock *hctx)
|
2006-09-19 22:13:37 +02:00
|
|
|
{
|
|
|
|
struct ccid2_seq *seqp;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* check if we have space to preserve the pointer to the buffer */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_seqbufc >= (sizeof(hctx->tx_seqbuf) /
|
|
|
|
sizeof(struct ccid2_seq *)))
|
2006-09-19 22:13:37 +02:00
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
/* allocate buffer and initialize linked list */
|
2007-10-04 23:41:00 +02:00
|
|
|
seqp = kmalloc(CCID2_SEQBUF_LEN * sizeof(struct ccid2_seq), gfp_any());
|
2006-09-19 22:13:37 +02:00
|
|
|
if (seqp == NULL)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
2007-10-04 23:41:00 +02:00
|
|
|
for (i = 0; i < (CCID2_SEQBUF_LEN - 1); i++) {
|
2006-09-19 22:13:37 +02:00
|
|
|
seqp[i].ccid2s_next = &seqp[i + 1];
|
|
|
|
seqp[i + 1].ccid2s_prev = &seqp[i];
|
|
|
|
}
|
2007-10-04 23:41:00 +02:00
|
|
|
seqp[CCID2_SEQBUF_LEN - 1].ccid2s_next = seqp;
|
|
|
|
seqp->ccid2s_prev = &seqp[CCID2_SEQBUF_LEN - 1];
|
2006-09-19 22:13:37 +02:00
|
|
|
|
|
|
|
/* This is the first allocation. Initiate the head and tail. */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_seqbufc == 0)
|
|
|
|
hctx->tx_seqh = hctx->tx_seqt = seqp;
|
2006-09-19 22:13:37 +02:00
|
|
|
else {
|
|
|
|
/* link the existing list with the one we just created */
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_seqh->ccid2s_next = seqp;
|
|
|
|
seqp->ccid2s_prev = hctx->tx_seqh;
|
2006-09-19 22:13:37 +02:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_seqt->ccid2s_prev = &seqp[CCID2_SEQBUF_LEN - 1];
|
|
|
|
seqp[CCID2_SEQBUF_LEN - 1].ccid2s_next = hctx->tx_seqt;
|
2006-09-19 22:13:37 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* store the original pointer to the buffer so we can free it */
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_seqbuf[hctx->tx_seqbufc] = seqp;
|
|
|
|
hctx->tx_seqbufc++;
|
2006-09-19 22:13:37 +02:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-11-28 22:55:06 +01:00
|
|
|
static int ccid2_hc_tx_send_packet(struct sock *sk, struct sk_buff *skb)
|
2006-03-21 02:41:47 +01:00
|
|
|
{
|
2008-09-09 13:27:22 +02:00
|
|
|
struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
|
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_pipe < hctx->tx_cwnd)
|
2008-09-09 13:27:22 +02:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
return 1; /* XXX CCID should dequeue when ready instead of polling */
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
|
|
|
|
2007-11-25 00:32:53 +01:00
|
|
|
static void ccid2_change_l_ack_ratio(struct sock *sk, u32 val)
|
2006-03-21 02:41:47 +01:00
|
|
|
{
|
|
|
|
struct dccp_sock *dp = dccp_sk(sk);
|
2009-10-05 02:53:10 +02:00
|
|
|
u32 max_ratio = DIV_ROUND_UP(ccid2_hc_tx_sk(sk)->tx_cwnd, 2);
|
2007-11-25 00:40:24 +01:00
|
|
|
|
2006-03-21 02:41:47 +01:00
|
|
|
/*
|
2007-11-25 00:40:24 +01:00
|
|
|
* Ensure that Ack Ratio does not exceed ceil(cwnd/2), which is (2) from
|
|
|
|
* RFC 4341, 6.1.2. We ignore the statement that Ack Ratio 2 is always
|
|
|
|
* acceptable since this causes starvation/deadlock whenever cwnd < 2.
|
|
|
|
* The same problem arises when Ack Ratio is 0 (ie. Ack Ratio disabled).
|
2006-03-21 02:41:47 +01:00
|
|
|
*/
|
2007-11-25 00:40:24 +01:00
|
|
|
if (val == 0 || val > max_ratio) {
|
|
|
|
DCCP_WARN("Limiting Ack Ratio (%u) to %u\n", val, max_ratio);
|
|
|
|
val = max_ratio;
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
2008-11-12 09:43:40 +01:00
|
|
|
if (val > DCCPF_ACK_RATIO_MAX)
|
|
|
|
val = DCCPF_ACK_RATIO_MAX;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2007-11-25 00:40:24 +01:00
|
|
|
if (val == dp->dccps_l_ack_ratio)
|
|
|
|
return;
|
|
|
|
|
2007-11-25 00:32:53 +01:00
|
|
|
ccid2_pr_debug("changing local ack ratio to %u\n", val);
|
2006-03-21 02:41:47 +01:00
|
|
|
dp->dccps_l_ack_ratio = val;
|
|
|
|
}
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
static void ccid2_change_srtt(struct ccid2_hc_tx_sock *hctx, long val)
|
|
|
|
{
|
|
|
|
ccid2_pr_debug("change SRTT to %ld\n", val);
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_srtt = val;
|
2008-09-09 13:27:22 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static void ccid2_start_rto_timer(struct sock *sk);
|
|
|
|
|
2006-03-21 02:41:47 +01:00
|
|
|
static void ccid2_hc_tx_rto_expire(unsigned long data)
|
|
|
|
{
|
|
|
|
struct sock *sk = (struct sock *)data;
|
|
|
|
struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
|
2008-09-09 13:27:22 +02:00
|
|
|
long s;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
|
|
|
bh_lock_sock(sk);
|
|
|
|
if (sock_owned_by_user(sk)) {
|
2009-10-05 02:53:10 +02:00
|
|
|
sk_reset_timer(sk, &hctx->tx_rtotimer, jiffies + HZ / 5);
|
2006-03-21 02:41:47 +01:00
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
ccid2_pr_debug("RTO_EXPIRE\n");
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_hc_tx_check_sanity(hctx);
|
|
|
|
|
2006-03-21 02:41:47 +01:00
|
|
|
/* back-off timer */
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_rto <<= 1;
|
2008-09-09 13:27:22 +02:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
s = hctx->tx_rto / HZ;
|
2008-09-09 13:27:22 +02:00
|
|
|
if (s > 60)
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_rto = 60 * HZ;
|
2008-09-09 13:27:22 +02:00
|
|
|
|
|
|
|
ccid2_start_rto_timer(sk);
|
2006-03-21 02:41:47 +01:00
|
|
|
|
|
|
|
/* adjust pipe, cwnd etc */
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_ssthresh = hctx->tx_cwnd / 2;
|
|
|
|
if (hctx->tx_ssthresh < 2)
|
|
|
|
hctx->tx_ssthresh = 2;
|
|
|
|
hctx->tx_cwnd = 1;
|
|
|
|
hctx->tx_pipe = 0;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
|
|
|
/* clear state about stuff we sent */
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_seqt = hctx->tx_seqh;
|
|
|
|
hctx->tx_packets_acked = 0;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
|
|
|
/* clear ack ratio state. */
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_rpseq = 0;
|
|
|
|
hctx->tx_rpdupack = -1;
|
2006-03-21 02:41:47 +01:00
|
|
|
ccid2_change_l_ack_ratio(sk, 1);
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_hc_tx_check_sanity(hctx);
|
2006-03-21 02:41:47 +01:00
|
|
|
out:
|
|
|
|
bh_unlock_sock(sk);
|
2006-03-21 02:57:52 +01:00
|
|
|
sock_put(sk);
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
static void ccid2_start_rto_timer(struct sock *sk)
|
|
|
|
{
|
|
|
|
struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
|
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
ccid2_pr_debug("setting RTO timeout=%ld\n", hctx->tx_rto);
|
2008-09-09 13:27:22 +02:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
BUG_ON(timer_pending(&hctx->tx_rtotimer));
|
|
|
|
sk_reset_timer(sk, &hctx->tx_rtotimer, jiffies + hctx->tx_rto);
|
2008-09-09 13:27:22 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static void ccid2_hc_tx_packet_sent(struct sock *sk, int more, unsigned int len)
|
2006-03-21 02:41:47 +01:00
|
|
|
{
|
|
|
|
struct dccp_sock *dp = dccp_sk(sk);
|
|
|
|
struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
|
2006-09-19 22:13:37 +02:00
|
|
|
struct ccid2_seq *next;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_pipe++;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_seqh->ccid2s_seq = dp->dccps_gss;
|
|
|
|
hctx->tx_seqh->ccid2s_acked = 0;
|
|
|
|
hctx->tx_seqh->ccid2s_sent = jiffies;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
next = hctx->tx_seqh->ccid2s_next;
|
2006-09-19 22:13:37 +02:00
|
|
|
/* check if we need to alloc more space */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (next == hctx->tx_seqt) {
|
2007-10-04 23:41:26 +02:00
|
|
|
if (ccid2_hc_tx_alloc_seq(hctx)) {
|
|
|
|
DCCP_CRIT("packet history - out of memory!");
|
|
|
|
/* FIXME: find a more graceful way to bail out */
|
|
|
|
return;
|
|
|
|
}
|
2009-10-05 02:53:10 +02:00
|
|
|
next = hctx->tx_seqh->ccid2s_next;
|
|
|
|
BUG_ON(next == hctx->tx_seqt);
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_seqh = next;
|
2006-09-19 22:13:37 +02:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
ccid2_pr_debug("cwnd=%d pipe=%d\n", hctx->tx_cwnd, hctx->tx_pipe);
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2007-11-25 00:58:33 +01:00
|
|
|
/*
|
|
|
|
* FIXME: The code below is broken and the variables have been removed
|
|
|
|
* from the socket struct. The `ackloss' variable was always set to 0,
|
|
|
|
* and with arsent there are several problems:
|
|
|
|
* (i) it doesn't just count the number of Acks, but all sent packets;
|
|
|
|
* (ii) it is expressed in # of packets, not # of windows, so the
|
|
|
|
* comparison below uses the wrong formula: Appendix A of RFC 4341
|
|
|
|
* comes up with the number K = cwnd / (R^2 - R) of consecutive windows
|
|
|
|
* of data with no lost or marked Ack packets. If arsent were the # of
|
|
|
|
* consecutive Acks received without loss, then Ack Ratio needs to be
|
|
|
|
* decreased by 1 when
|
|
|
|
* arsent >= K * cwnd / R = cwnd^2 / (R^3 - R^2)
|
|
|
|
* where cwnd / R is the number of Acks received per window of data
|
|
|
|
* (cf. RFC 4341, App. A). The problems are that
|
|
|
|
* - arsent counts other packets as well;
|
|
|
|
* - the comparison uses a formula different from RFC 4341;
|
|
|
|
* - computing a cubic/quadratic equation each time is too complicated.
|
|
|
|
* Hence a different algorithm is needed.
|
|
|
|
*/
|
|
|
|
#if 0
|
2006-03-21 02:41:47 +01:00
|
|
|
/* Ack Ratio. Need to maintain a concept of how many windows we sent */
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_arsent++;
|
2006-03-21 02:41:47 +01:00
|
|
|
/* We had an ack loss in this window... */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_ackloss) {
|
|
|
|
if (hctx->tx_arsent >= hctx->tx_cwnd) {
|
|
|
|
hctx->tx_arsent = 0;
|
|
|
|
hctx->tx_ackloss = 0;
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
2006-03-21 07:05:37 +01:00
|
|
|
} else {
|
|
|
|
/* No acks lost up to now... */
|
2006-03-21 02:41:47 +01:00
|
|
|
/* decrease ack ratio if enough packets were sent */
|
|
|
|
if (dp->dccps_l_ack_ratio > 1) {
|
|
|
|
/* XXX don't calculate denominator each time */
|
2006-03-21 07:05:37 +01:00
|
|
|
int denom = dp->dccps_l_ack_ratio * dp->dccps_l_ack_ratio -
|
|
|
|
dp->dccps_l_ack_ratio;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
denom = hctx->tx_cwnd * hctx->tx_cwnd / denom;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_arsent >= denom) {
|
2006-03-21 02:41:47 +01:00
|
|
|
ccid2_change_l_ack_ratio(sk, dp->dccps_l_ack_ratio - 1);
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_arsent = 0;
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
2006-03-21 07:05:37 +01:00
|
|
|
} else {
|
|
|
|
/* we can't increase ack ratio further [1] */
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_arsent = 0; /* or maybe set it to cwnd*/
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
|
|
|
}
|
2007-11-25 00:58:33 +01:00
|
|
|
#endif
|
2006-03-21 02:41:47 +01:00
|
|
|
|
|
|
|
/* setup RTO timer */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (!timer_pending(&hctx->tx_rtotimer))
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_start_rto_timer(sk);
|
2006-03-21 07:05:37 +01:00
|
|
|
|
2006-09-19 22:12:44 +02:00
|
|
|
#ifdef CONFIG_IP_DCCP_CCID2_DEBUG
|
2006-03-21 02:41:47 +01:00
|
|
|
do {
|
2009-10-05 02:53:10 +02:00
|
|
|
struct ccid2_seq *seqp = hctx->tx_seqt;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
while (seqp != hctx->tx_seqh) {
|
2006-03-21 02:41:47 +01:00
|
|
|
ccid2_pr_debug("out seq=%llu acked=%d time=%lu\n",
|
2006-12-10 19:01:18 +01:00
|
|
|
(unsigned long long)seqp->ccid2s_seq,
|
2006-10-30 01:03:30 +01:00
|
|
|
seqp->ccid2s_acked, seqp->ccid2s_sent);
|
2006-03-21 02:41:47 +01:00
|
|
|
seqp = seqp->ccid2s_next;
|
|
|
|
}
|
2006-03-21 07:05:37 +01:00
|
|
|
} while (0);
|
2006-03-21 02:41:47 +01:00
|
|
|
ccid2_pr_debug("=========\n");
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_hc_tx_check_sanity(hctx);
|
2006-03-21 02:41:47 +01:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
/* XXX Lame code duplication!
|
|
|
|
* returns -1 if none was found.
|
|
|
|
* else returns the next offset to use in the function call.
|
dccp ccid-2: Replace broken RTT estimator with better algorithm
The current CCID-2 RTT estimator code is in parts broken and lags behind the
suggestions in RFC2988 of using scaled variants for SRTT/RTTVAR.
That code is replaced by the present patch, which reuses the Linux TCP RTT
estimator code - reasons for this code duplication are given below.
Further details:
----------------
1. The minimum RTO of previously one second has been replaced with TCP's, since
RFC4341, sec. 5 says that the minimum of 1 sec. (suggested in RFC2988, 2.4)
is not necessary. Instead, the TCP_RTO_MIN is used, which agrees with DCCP's
concept of a default RTT (RFC 4340, 3.4).
2. The maximum RTO has been set to DCCP_RTO_MAX (64 sec), which agrees with
RFC2988, (2.5).
3. De-inlined the function ccid2_new_ack().
4. Added a FIXME: the RTT is sampled several times per Ack Vector, which will
give the wrong estimate. It should be replaced with one sample per Ack.
However, at the moment this can not be resolved easily, since
- it depends on TX history code (which also needs some work),
- the cleanest solution is not to use the `sent' time at all (saves 4 bytes
per entry) and use DCCP timestamps / elapsed time to estimated the RTT,
which however is non-trivial to get right (but needs to be done).
Reasons for reusing the Linux TCP estimator algorithm:
------------------------------------------------------
Some time was spent to find a better alternative, using basic RFC2988 as a first
step. Further analysis and experimentation showed that the Linux TCP RTO
estimator is superior to a basic RFC2988 implementation. A summary is on
http://www.erg.abdn.ac.uk/users/gerrit/dccp/notes/ccid2/rto_estimator/
In addition, this estimator fared well in a recent empirical evaluation:
Rewaskar, Sushant, Jasleen Kaur and F. Donelson Smith.
A Performance Study of Loss Detection/Recovery in Real-world TCP
Implementations. Proceedings of 15th IEEE International
Conference on Network Protocols (ICNP-07). 2007.
Thus there is significant benefit in reusing the existing TCP code.
Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
2008-09-04 07:30:19 +02:00
|
|
|
*/
|
2008-09-09 13:27:22 +02:00
|
|
|
static int ccid2_ackvector(struct sock *sk, struct sk_buff *skb, int offset,
|
|
|
|
unsigned char **vec, unsigned char *veclen)
|
dccp ccid-2: Replace broken RTT estimator with better algorithm
The current CCID-2 RTT estimator code is in parts broken and lags behind the
suggestions in RFC2988 of using scaled variants for SRTT/RTTVAR.
That code is replaced by the present patch, which reuses the Linux TCP RTT
estimator code - reasons for this code duplication are given below.
Further details:
----------------
1. The minimum RTO of previously one second has been replaced with TCP's, since
RFC4341, sec. 5 says that the minimum of 1 sec. (suggested in RFC2988, 2.4)
is not necessary. Instead, the TCP_RTO_MIN is used, which agrees with DCCP's
concept of a default RTT (RFC 4340, 3.4).
2. The maximum RTO has been set to DCCP_RTO_MAX (64 sec), which agrees with
RFC2988, (2.5).
3. De-inlined the function ccid2_new_ack().
4. Added a FIXME: the RTT is sampled several times per Ack Vector, which will
give the wrong estimate. It should be replaced with one sample per Ack.
However, at the moment this can not be resolved easily, since
- it depends on TX history code (which also needs some work),
- the cleanest solution is not to use the `sent' time at all (saves 4 bytes
per entry) and use DCCP timestamps / elapsed time to estimated the RTT,
which however is non-trivial to get right (but needs to be done).
Reasons for reusing the Linux TCP estimator algorithm:
------------------------------------------------------
Some time was spent to find a better alternative, using basic RFC2988 as a first
step. Further analysis and experimentation showed that the Linux TCP RTO
estimator is superior to a basic RFC2988 implementation. A summary is on
http://www.erg.abdn.ac.uk/users/gerrit/dccp/notes/ccid2/rto_estimator/
In addition, this estimator fared well in a recent empirical evaluation:
Rewaskar, Sushant, Jasleen Kaur and F. Donelson Smith.
A Performance Study of Loss Detection/Recovery in Real-world TCP
Implementations. Proceedings of 15th IEEE International
Conference on Network Protocols (ICNP-07). 2007.
Thus there is significant benefit in reusing the existing TCP code.
Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
2008-09-04 07:30:19 +02:00
|
|
|
{
|
2008-09-09 13:27:22 +02:00
|
|
|
const struct dccp_hdr *dh = dccp_hdr(skb);
|
|
|
|
unsigned char *options = (unsigned char *)dh + dccp_hdr_len(skb);
|
|
|
|
unsigned char *opt_ptr;
|
|
|
|
const unsigned char *opt_end = (unsigned char *)dh +
|
|
|
|
(dh->dccph_doff * 4);
|
|
|
|
unsigned char opt, len;
|
|
|
|
unsigned char *value;
|
|
|
|
|
|
|
|
BUG_ON(offset < 0);
|
|
|
|
options += offset;
|
|
|
|
opt_ptr = options;
|
|
|
|
if (opt_ptr >= opt_end)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
while (opt_ptr != opt_end) {
|
|
|
|
opt = *opt_ptr++;
|
|
|
|
len = 0;
|
|
|
|
value = NULL;
|
|
|
|
|
|
|
|
/* Check if this isn't a single byte option */
|
|
|
|
if (opt > DCCPO_MAX_RESERVED) {
|
|
|
|
if (opt_ptr == opt_end)
|
|
|
|
goto out_invalid_option;
|
|
|
|
|
|
|
|
len = *opt_ptr++;
|
|
|
|
if (len < 3)
|
|
|
|
goto out_invalid_option;
|
dccp ccid-2: Replace broken RTT estimator with better algorithm
The current CCID-2 RTT estimator code is in parts broken and lags behind the
suggestions in RFC2988 of using scaled variants for SRTT/RTTVAR.
That code is replaced by the present patch, which reuses the Linux TCP RTT
estimator code - reasons for this code duplication are given below.
Further details:
----------------
1. The minimum RTO of previously one second has been replaced with TCP's, since
RFC4341, sec. 5 says that the minimum of 1 sec. (suggested in RFC2988, 2.4)
is not necessary. Instead, the TCP_RTO_MIN is used, which agrees with DCCP's
concept of a default RTT (RFC 4340, 3.4).
2. The maximum RTO has been set to DCCP_RTO_MAX (64 sec), which agrees with
RFC2988, (2.5).
3. De-inlined the function ccid2_new_ack().
4. Added a FIXME: the RTT is sampled several times per Ack Vector, which will
give the wrong estimate. It should be replaced with one sample per Ack.
However, at the moment this can not be resolved easily, since
- it depends on TX history code (which also needs some work),
- the cleanest solution is not to use the `sent' time at all (saves 4 bytes
per entry) and use DCCP timestamps / elapsed time to estimated the RTT,
which however is non-trivial to get right (but needs to be done).
Reasons for reusing the Linux TCP estimator algorithm:
------------------------------------------------------
Some time was spent to find a better alternative, using basic RFC2988 as a first
step. Further analysis and experimentation showed that the Linux TCP RTO
estimator is superior to a basic RFC2988 implementation. A summary is on
http://www.erg.abdn.ac.uk/users/gerrit/dccp/notes/ccid2/rto_estimator/
In addition, this estimator fared well in a recent empirical evaluation:
Rewaskar, Sushant, Jasleen Kaur and F. Donelson Smith.
A Performance Study of Loss Detection/Recovery in Real-world TCP
Implementations. Proceedings of 15th IEEE International
Conference on Network Protocols (ICNP-07). 2007.
Thus there is significant benefit in reusing the existing TCP code.
Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
2008-09-04 07:30:19 +02:00
|
|
|
/*
|
2008-09-09 13:27:22 +02:00
|
|
|
* Remove the type and len fields, leaving
|
|
|
|
* just the value size
|
dccp ccid-2: Replace broken RTT estimator with better algorithm
The current CCID-2 RTT estimator code is in parts broken and lags behind the
suggestions in RFC2988 of using scaled variants for SRTT/RTTVAR.
That code is replaced by the present patch, which reuses the Linux TCP RTT
estimator code - reasons for this code duplication are given below.
Further details:
----------------
1. The minimum RTO of previously one second has been replaced with TCP's, since
RFC4341, sec. 5 says that the minimum of 1 sec. (suggested in RFC2988, 2.4)
is not necessary. Instead, the TCP_RTO_MIN is used, which agrees with DCCP's
concept of a default RTT (RFC 4340, 3.4).
2. The maximum RTO has been set to DCCP_RTO_MAX (64 sec), which agrees with
RFC2988, (2.5).
3. De-inlined the function ccid2_new_ack().
4. Added a FIXME: the RTT is sampled several times per Ack Vector, which will
give the wrong estimate. It should be replaced with one sample per Ack.
However, at the moment this can not be resolved easily, since
- it depends on TX history code (which also needs some work),
- the cleanest solution is not to use the `sent' time at all (saves 4 bytes
per entry) and use DCCP timestamps / elapsed time to estimated the RTT,
which however is non-trivial to get right (but needs to be done).
Reasons for reusing the Linux TCP estimator algorithm:
------------------------------------------------------
Some time was spent to find a better alternative, using basic RFC2988 as a first
step. Further analysis and experimentation showed that the Linux TCP RTO
estimator is superior to a basic RFC2988 implementation. A summary is on
http://www.erg.abdn.ac.uk/users/gerrit/dccp/notes/ccid2/rto_estimator/
In addition, this estimator fared well in a recent empirical evaluation:
Rewaskar, Sushant, Jasleen Kaur and F. Donelson Smith.
A Performance Study of Loss Detection/Recovery in Real-world TCP
Implementations. Proceedings of 15th IEEE International
Conference on Network Protocols (ICNP-07). 2007.
Thus there is significant benefit in reusing the existing TCP code.
Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
2008-09-04 07:30:19 +02:00
|
|
|
*/
|
2008-09-09 13:27:22 +02:00
|
|
|
len -= 2;
|
|
|
|
value = opt_ptr;
|
|
|
|
opt_ptr += len;
|
dccp ccid-2: Replace broken RTT estimator with better algorithm
The current CCID-2 RTT estimator code is in parts broken and lags behind the
suggestions in RFC2988 of using scaled variants for SRTT/RTTVAR.
That code is replaced by the present patch, which reuses the Linux TCP RTT
estimator code - reasons for this code duplication are given below.
Further details:
----------------
1. The minimum RTO of previously one second has been replaced with TCP's, since
RFC4341, sec. 5 says that the minimum of 1 sec. (suggested in RFC2988, 2.4)
is not necessary. Instead, the TCP_RTO_MIN is used, which agrees with DCCP's
concept of a default RTT (RFC 4340, 3.4).
2. The maximum RTO has been set to DCCP_RTO_MAX (64 sec), which agrees with
RFC2988, (2.5).
3. De-inlined the function ccid2_new_ack().
4. Added a FIXME: the RTT is sampled several times per Ack Vector, which will
give the wrong estimate. It should be replaced with one sample per Ack.
However, at the moment this can not be resolved easily, since
- it depends on TX history code (which also needs some work),
- the cleanest solution is not to use the `sent' time at all (saves 4 bytes
per entry) and use DCCP timestamps / elapsed time to estimated the RTT,
which however is non-trivial to get right (but needs to be done).
Reasons for reusing the Linux TCP estimator algorithm:
------------------------------------------------------
Some time was spent to find a better alternative, using basic RFC2988 as a first
step. Further analysis and experimentation showed that the Linux TCP RTO
estimator is superior to a basic RFC2988 implementation. A summary is on
http://www.erg.abdn.ac.uk/users/gerrit/dccp/notes/ccid2/rto_estimator/
In addition, this estimator fared well in a recent empirical evaluation:
Rewaskar, Sushant, Jasleen Kaur and F. Donelson Smith.
A Performance Study of Loss Detection/Recovery in Real-world TCP
Implementations. Proceedings of 15th IEEE International
Conference on Network Protocols (ICNP-07). 2007.
Thus there is significant benefit in reusing the existing TCP code.
Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
2008-09-04 07:30:19 +02:00
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
if (opt_ptr > opt_end)
|
|
|
|
goto out_invalid_option;
|
dccp ccid-2: Replace broken RTT estimator with better algorithm
The current CCID-2 RTT estimator code is in parts broken and lags behind the
suggestions in RFC2988 of using scaled variants for SRTT/RTTVAR.
That code is replaced by the present patch, which reuses the Linux TCP RTT
estimator code - reasons for this code duplication are given below.
Further details:
----------------
1. The minimum RTO of previously one second has been replaced with TCP's, since
RFC4341, sec. 5 says that the minimum of 1 sec. (suggested in RFC2988, 2.4)
is not necessary. Instead, the TCP_RTO_MIN is used, which agrees with DCCP's
concept of a default RTT (RFC 4340, 3.4).
2. The maximum RTO has been set to DCCP_RTO_MAX (64 sec), which agrees with
RFC2988, (2.5).
3. De-inlined the function ccid2_new_ack().
4. Added a FIXME: the RTT is sampled several times per Ack Vector, which will
give the wrong estimate. It should be replaced with one sample per Ack.
However, at the moment this can not be resolved easily, since
- it depends on TX history code (which also needs some work),
- the cleanest solution is not to use the `sent' time at all (saves 4 bytes
per entry) and use DCCP timestamps / elapsed time to estimated the RTT,
which however is non-trivial to get right (but needs to be done).
Reasons for reusing the Linux TCP estimator algorithm:
------------------------------------------------------
Some time was spent to find a better alternative, using basic RFC2988 as a first
step. Further analysis and experimentation showed that the Linux TCP RTO
estimator is superior to a basic RFC2988 implementation. A summary is on
http://www.erg.abdn.ac.uk/users/gerrit/dccp/notes/ccid2/rto_estimator/
In addition, this estimator fared well in a recent empirical evaluation:
Rewaskar, Sushant, Jasleen Kaur and F. Donelson Smith.
A Performance Study of Loss Detection/Recovery in Real-world TCP
Implementations. Proceedings of 15th IEEE International
Conference on Network Protocols (ICNP-07). 2007.
Thus there is significant benefit in reusing the existing TCP code.
Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
2008-09-04 07:30:19 +02:00
|
|
|
}
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
switch (opt) {
|
|
|
|
case DCCPO_ACK_VECTOR_0:
|
|
|
|
case DCCPO_ACK_VECTOR_1:
|
|
|
|
*vec = value;
|
|
|
|
*veclen = len;
|
|
|
|
return offset + (opt_ptr - options);
|
dccp ccid-2: Replace broken RTT estimator with better algorithm
The current CCID-2 RTT estimator code is in parts broken and lags behind the
suggestions in RFC2988 of using scaled variants for SRTT/RTTVAR.
That code is replaced by the present patch, which reuses the Linux TCP RTT
estimator code - reasons for this code duplication are given below.
Further details:
----------------
1. The minimum RTO of previously one second has been replaced with TCP's, since
RFC4341, sec. 5 says that the minimum of 1 sec. (suggested in RFC2988, 2.4)
is not necessary. Instead, the TCP_RTO_MIN is used, which agrees with DCCP's
concept of a default RTT (RFC 4340, 3.4).
2. The maximum RTO has been set to DCCP_RTO_MAX (64 sec), which agrees with
RFC2988, (2.5).
3. De-inlined the function ccid2_new_ack().
4. Added a FIXME: the RTT is sampled several times per Ack Vector, which will
give the wrong estimate. It should be replaced with one sample per Ack.
However, at the moment this can not be resolved easily, since
- it depends on TX history code (which also needs some work),
- the cleanest solution is not to use the `sent' time at all (saves 4 bytes
per entry) and use DCCP timestamps / elapsed time to estimated the RTT,
which however is non-trivial to get right (but needs to be done).
Reasons for reusing the Linux TCP estimator algorithm:
------------------------------------------------------
Some time was spent to find a better alternative, using basic RFC2988 as a first
step. Further analysis and experimentation showed that the Linux TCP RTO
estimator is superior to a basic RFC2988 implementation. A summary is on
http://www.erg.abdn.ac.uk/users/gerrit/dccp/notes/ccid2/rto_estimator/
In addition, this estimator fared well in a recent empirical evaluation:
Rewaskar, Sushant, Jasleen Kaur and F. Donelson Smith.
A Performance Study of Loss Detection/Recovery in Real-world TCP
Implementations. Proceedings of 15th IEEE International
Conference on Network Protocols (ICNP-07). 2007.
Thus there is significant benefit in reusing the existing TCP code.
Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
2008-09-04 07:30:19 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
return -1;
|
dccp ccid-2: Replace broken RTT estimator with better algorithm
The current CCID-2 RTT estimator code is in parts broken and lags behind the
suggestions in RFC2988 of using scaled variants for SRTT/RTTVAR.
That code is replaced by the present patch, which reuses the Linux TCP RTT
estimator code - reasons for this code duplication are given below.
Further details:
----------------
1. The minimum RTO of previously one second has been replaced with TCP's, since
RFC4341, sec. 5 says that the minimum of 1 sec. (suggested in RFC2988, 2.4)
is not necessary. Instead, the TCP_RTO_MIN is used, which agrees with DCCP's
concept of a default RTT (RFC 4340, 3.4).
2. The maximum RTO has been set to DCCP_RTO_MAX (64 sec), which agrees with
RFC2988, (2.5).
3. De-inlined the function ccid2_new_ack().
4. Added a FIXME: the RTT is sampled several times per Ack Vector, which will
give the wrong estimate. It should be replaced with one sample per Ack.
However, at the moment this can not be resolved easily, since
- it depends on TX history code (which also needs some work),
- the cleanest solution is not to use the `sent' time at all (saves 4 bytes
per entry) and use DCCP timestamps / elapsed time to estimated the RTT,
which however is non-trivial to get right (but needs to be done).
Reasons for reusing the Linux TCP estimator algorithm:
------------------------------------------------------
Some time was spent to find a better alternative, using basic RFC2988 as a first
step. Further analysis and experimentation showed that the Linux TCP RTO
estimator is superior to a basic RFC2988 implementation. A summary is on
http://www.erg.abdn.ac.uk/users/gerrit/dccp/notes/ccid2/rto_estimator/
In addition, this estimator fared well in a recent empirical evaluation:
Rewaskar, Sushant, Jasleen Kaur and F. Donelson Smith.
A Performance Study of Loss Detection/Recovery in Real-world TCP
Implementations. Proceedings of 15th IEEE International
Conference on Network Protocols (ICNP-07). 2007.
Thus there is significant benefit in reusing the existing TCP code.
Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
2008-09-04 07:30:19 +02:00
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
out_invalid_option:
|
|
|
|
DCCP_BUG("Invalid option - this should not happen (previous parsing)!");
|
|
|
|
return -1;
|
dccp ccid-2: Replace broken RTT estimator with better algorithm
The current CCID-2 RTT estimator code is in parts broken and lags behind the
suggestions in RFC2988 of using scaled variants for SRTT/RTTVAR.
That code is replaced by the present patch, which reuses the Linux TCP RTT
estimator code - reasons for this code duplication are given below.
Further details:
----------------
1. The minimum RTO of previously one second has been replaced with TCP's, since
RFC4341, sec. 5 says that the minimum of 1 sec. (suggested in RFC2988, 2.4)
is not necessary. Instead, the TCP_RTO_MIN is used, which agrees with DCCP's
concept of a default RTT (RFC 4340, 3.4).
2. The maximum RTO has been set to DCCP_RTO_MAX (64 sec), which agrees with
RFC2988, (2.5).
3. De-inlined the function ccid2_new_ack().
4. Added a FIXME: the RTT is sampled several times per Ack Vector, which will
give the wrong estimate. It should be replaced with one sample per Ack.
However, at the moment this can not be resolved easily, since
- it depends on TX history code (which also needs some work),
- the cleanest solution is not to use the `sent' time at all (saves 4 bytes
per entry) and use DCCP timestamps / elapsed time to estimated the RTT,
which however is non-trivial to get right (but needs to be done).
Reasons for reusing the Linux TCP estimator algorithm:
------------------------------------------------------
Some time was spent to find a better alternative, using basic RFC2988 as a first
step. Further analysis and experimentation showed that the Linux TCP RTO
estimator is superior to a basic RFC2988 implementation. A summary is on
http://www.erg.abdn.ac.uk/users/gerrit/dccp/notes/ccid2/rto_estimator/
In addition, this estimator fared well in a recent empirical evaluation:
Rewaskar, Sushant, Jasleen Kaur and F. Donelson Smith.
A Performance Study of Loss Detection/Recovery in Real-world TCP
Implementations. Proceedings of 15th IEEE International
Conference on Network Protocols (ICNP-07). 2007.
Thus there is significant benefit in reusing the existing TCP code.
Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
2008-09-04 07:30:19 +02:00
|
|
|
}
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
static void ccid2_hc_tx_kill_rto_timer(struct sock *sk)
|
2006-03-21 02:41:47 +01:00
|
|
|
{
|
|
|
|
struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
|
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
sk_stop_timer(sk, &hctx->tx_rtotimer);
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_pr_debug("deleted RTO timer\n");
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
static inline void ccid2_new_ack(struct sock *sk,
|
|
|
|
struct ccid2_seq *seqp,
|
|
|
|
unsigned int *maxincr)
|
2006-09-19 22:14:43 +02:00
|
|
|
{
|
2007-11-25 00:40:24 +01:00
|
|
|
struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
|
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_cwnd < hctx->tx_ssthresh) {
|
|
|
|
if (*maxincr > 0 && ++hctx->tx_packets_acked == 2) {
|
|
|
|
hctx->tx_cwnd += 1;
|
|
|
|
*maxincr -= 1;
|
|
|
|
hctx->tx_packets_acked = 0;
|
2008-09-09 13:27:22 +02:00
|
|
|
}
|
2009-10-05 02:53:10 +02:00
|
|
|
} else if (++hctx->tx_packets_acked >= hctx->tx_cwnd) {
|
|
|
|
hctx->tx_cwnd += 1;
|
|
|
|
hctx->tx_packets_acked = 0;
|
2006-09-19 22:14:43 +02:00
|
|
|
}
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
/* update RTO */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_srtt == -1 ||
|
|
|
|
time_after(jiffies, hctx->tx_lastrtt + hctx->tx_srtt)) {
|
2008-09-09 13:27:22 +02:00
|
|
|
unsigned long r = (long)jiffies - (long)seqp->ccid2s_sent;
|
|
|
|
int s;
|
|
|
|
|
|
|
|
/* first measurement */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_srtt == -1) {
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_pr_debug("R: %lu Time=%lu seq=%llu\n",
|
|
|
|
r, jiffies,
|
|
|
|
(unsigned long long)seqp->ccid2s_seq);
|
|
|
|
ccid2_change_srtt(hctx, r);
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_rttvar = r >> 1;
|
2008-09-09 13:27:22 +02:00
|
|
|
} else {
|
|
|
|
/* RTTVAR */
|
2009-10-05 02:53:10 +02:00
|
|
|
long tmp = hctx->tx_srtt - r;
|
2008-09-09 13:27:22 +02:00
|
|
|
long srtt;
|
|
|
|
|
|
|
|
if (tmp < 0)
|
|
|
|
tmp *= -1;
|
|
|
|
|
|
|
|
tmp >>= 2;
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_rttvar *= 3;
|
|
|
|
hctx->tx_rttvar >>= 2;
|
|
|
|
hctx->tx_rttvar += tmp;
|
2008-09-09 13:27:22 +02:00
|
|
|
|
|
|
|
/* SRTT */
|
2009-10-05 02:53:10 +02:00
|
|
|
srtt = hctx->tx_srtt;
|
2008-09-09 13:27:22 +02:00
|
|
|
srtt *= 7;
|
|
|
|
srtt >>= 3;
|
|
|
|
tmp = r >> 3;
|
|
|
|
srtt += tmp;
|
|
|
|
ccid2_change_srtt(hctx, srtt);
|
|
|
|
}
|
2009-10-05 02:53:10 +02:00
|
|
|
s = hctx->tx_rttvar << 2;
|
2008-09-09 13:27:22 +02:00
|
|
|
/* clock granularity is 1 when based on jiffies */
|
|
|
|
if (!s)
|
|
|
|
s = 1;
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_rto = hctx->tx_srtt + s;
|
2008-09-09 13:27:22 +02:00
|
|
|
|
|
|
|
/* must be at least a second */
|
2009-10-05 02:53:10 +02:00
|
|
|
s = hctx->tx_rto / HZ;
|
2008-09-09 13:27:22 +02:00
|
|
|
/* DCCP doesn't require this [but I like it cuz my code sux] */
|
|
|
|
#if 1
|
|
|
|
if (s < 1)
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_rto = HZ;
|
2008-09-09 13:27:22 +02:00
|
|
|
#endif
|
|
|
|
/* max 60 seconds */
|
|
|
|
if (s > 60)
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_rto = HZ * 60;
|
2006-09-19 22:14:43 +02:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_lastrtt = jiffies;
|
2007-11-25 00:40:24 +01:00
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_pr_debug("srtt: %ld rttvar: %ld rto: %ld (HZ=%d) R=%lu\n",
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_srtt, hctx->tx_rttvar,
|
|
|
|
hctx->tx_rto, HZ, r);
|
2008-09-09 13:27:22 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* we got a new ack, so re-start RTO timer */
|
|
|
|
ccid2_hc_tx_kill_rto_timer(sk);
|
|
|
|
ccid2_start_rto_timer(sk);
|
2006-09-19 22:14:43 +02:00
|
|
|
}
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
static void ccid2_hc_tx_dec_pipe(struct sock *sk)
|
2008-09-04 07:30:19 +02:00
|
|
|
{
|
|
|
|
struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
|
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_pipe == 0)
|
2008-09-09 13:27:22 +02:00
|
|
|
DCCP_BUG("pipe == 0");
|
|
|
|
else
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_pipe--;
|
2008-09-09 13:27:22 +02:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_pipe == 0)
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_hc_tx_kill_rto_timer(sk);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void ccid2_congestion_event(struct sock *sk, struct ccid2_seq *seqp)
|
|
|
|
{
|
|
|
|
struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
|
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
if (time_before(seqp->ccid2s_sent, hctx->tx_last_cong)) {
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_pr_debug("Multiple losses in an RTT---treating as one\n");
|
|
|
|
return;
|
2008-09-04 07:30:19 +02:00
|
|
|
}
|
2008-09-09 13:27:22 +02:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_last_cong = jiffies;
|
2008-09-09 13:27:22 +02:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_cwnd = hctx->tx_cwnd / 2 ? : 1U;
|
|
|
|
hctx->tx_ssthresh = max(hctx->tx_cwnd, 2U);
|
2008-09-09 13:27:22 +02:00
|
|
|
|
|
|
|
/* Avoid spurious timeouts resulting from Ack Ratio > cwnd */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (dccp_sk(sk)->dccps_l_ack_ratio > hctx->tx_cwnd)
|
|
|
|
ccid2_change_l_ack_ratio(sk, hctx->tx_cwnd);
|
2008-09-04 07:30:19 +02:00
|
|
|
}
|
|
|
|
|
2006-03-21 02:41:47 +01:00
|
|
|
static void ccid2_hc_tx_packet_recv(struct sock *sk, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
struct dccp_sock *dp = dccp_sk(sk);
|
|
|
|
struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
|
|
|
|
u64 ackno, seqno;
|
|
|
|
struct ccid2_seq *seqp;
|
2008-09-09 13:27:22 +02:00
|
|
|
unsigned char *vector;
|
|
|
|
unsigned char veclen;
|
|
|
|
int offset = 0;
|
2006-03-21 02:41:47 +01:00
|
|
|
int done = 0;
|
|
|
|
unsigned int maxincr = 0;
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_hc_tx_check_sanity(hctx);
|
2006-03-21 02:41:47 +01:00
|
|
|
/* check reverse path congestion */
|
|
|
|
seqno = DCCP_SKB_CB(skb)->dccpd_seq;
|
|
|
|
|
|
|
|
/* XXX this whole "algorithm" is broken. Need to fix it to keep track
|
|
|
|
* of the seqnos of the dupacks so that rpseq and rpdupack are correct
|
|
|
|
* -sorbo.
|
|
|
|
*/
|
|
|
|
/* need to bootstrap */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_rpdupack == -1) {
|
|
|
|
hctx->tx_rpdupack = 0;
|
|
|
|
hctx->tx_rpseq = seqno;
|
2006-03-21 07:05:37 +01:00
|
|
|
} else {
|
2006-03-21 02:41:47 +01:00
|
|
|
/* check if packet is consecutive */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (dccp_delta_seqno(hctx->tx_rpseq, seqno) == 1)
|
|
|
|
hctx->tx_rpseq = seqno;
|
2006-03-21 02:41:47 +01:00
|
|
|
/* it's a later packet */
|
2009-10-05 02:53:10 +02:00
|
|
|
else if (after48(seqno, hctx->tx_rpseq)) {
|
|
|
|
hctx->tx_rpdupack++;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
|
|
|
/* check if we got enough dupacks */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_rpdupack >= NUMDUPACK) {
|
|
|
|
hctx->tx_rpdupack = -1; /* XXX lame */
|
|
|
|
hctx->tx_rpseq = 0;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2007-11-25 00:32:53 +01:00
|
|
|
ccid2_change_l_ack_ratio(sk, 2 * dp->dccps_l_ack_ratio);
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* check forward path congestion */
|
2008-09-09 13:27:22 +02:00
|
|
|
/* still didn't send out new data packets */
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_seqh == hctx->tx_seqt)
|
2006-03-21 02:41:47 +01:00
|
|
|
return;
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
switch (DCCP_SKB_CB(skb)->dccpd_type) {
|
|
|
|
case DCCP_PKT_ACK:
|
|
|
|
case DCCP_PKT_DATAACK:
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return;
|
|
|
|
}
|
2006-03-21 02:41:47 +01:00
|
|
|
|
|
|
|
ackno = DCCP_SKB_CB(skb)->dccpd_ack_seq;
|
2009-10-05 02:53:10 +02:00
|
|
|
if (after48(ackno, hctx->tx_high_ack))
|
|
|
|
hctx->tx_high_ack = ackno;
|
2006-11-16 17:28:40 +01:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
seqp = hctx->tx_seqt;
|
2006-11-16 17:28:40 +01:00
|
|
|
while (before48(seqp->ccid2s_seq, ackno)) {
|
|
|
|
seqp = seqp->ccid2s_next;
|
2009-10-05 02:53:10 +02:00
|
|
|
if (seqp == hctx->tx_seqh) {
|
|
|
|
seqp = hctx->tx_seqh->ccid2s_prev;
|
2006-11-16 17:28:40 +01:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2007-11-25 01:10:29 +01:00
|
|
|
/*
|
|
|
|
* In slow-start, cwnd can increase up to a maximum of Ack Ratio/2
|
|
|
|
* packets per acknowledgement. Rounding up avoids that cwnd is not
|
|
|
|
* advanced when Ack Ratio is 1 and gives a slight edge otherwise.
|
2006-03-21 02:41:47 +01:00
|
|
|
*/
|
2009-10-05 02:53:10 +02:00
|
|
|
if (hctx->tx_cwnd < hctx->tx_ssthresh)
|
2007-11-25 01:10:29 +01:00
|
|
|
maxincr = DIV_ROUND_UP(dp->dccps_l_ack_ratio, 2);
|
2006-03-21 02:41:47 +01:00
|
|
|
|
|
|
|
/* go through all ack vectors */
|
2008-09-09 13:27:22 +02:00
|
|
|
while ((offset = ccid2_ackvector(sk, skb, offset,
|
|
|
|
&vector, &veclen)) != -1) {
|
2006-03-21 02:41:47 +01:00
|
|
|
/* go through this ack vector */
|
2008-09-09 13:27:22 +02:00
|
|
|
while (veclen--) {
|
|
|
|
const u8 rl = *vector & DCCP_ACKVEC_LEN_MASK;
|
|
|
|
u64 ackno_end_rl = SUB48(ackno, rl);
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_pr_debug("ackvec start:%llu end:%llu\n",
|
2006-10-30 01:03:30 +01:00
|
|
|
(unsigned long long)ackno,
|
2008-09-09 13:27:22 +02:00
|
|
|
(unsigned long long)ackno_end_rl);
|
2006-03-21 02:41:47 +01:00
|
|
|
/* if the seqno we are analyzing is larger than the
|
|
|
|
* current ackno, then move towards the tail of our
|
|
|
|
* seqnos.
|
|
|
|
*/
|
|
|
|
while (after48(seqp->ccid2s_seq, ackno)) {
|
2009-10-05 02:53:10 +02:00
|
|
|
if (seqp == hctx->tx_seqt) {
|
2006-03-21 02:41:47 +01:00
|
|
|
done = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
seqp = seqp->ccid2s_prev;
|
|
|
|
}
|
|
|
|
if (done)
|
|
|
|
break;
|
|
|
|
|
|
|
|
/* check all seqnos in the range of the vector
|
|
|
|
* run length
|
|
|
|
*/
|
|
|
|
while (between48(seqp->ccid2s_seq,ackno_end_rl,ackno)) {
|
2008-09-09 13:27:22 +02:00
|
|
|
const u8 state = *vector &
|
|
|
|
DCCP_ACKVEC_STATE_MASK;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
|
|
|
/* new packet received or marked */
|
2008-09-09 13:27:22 +02:00
|
|
|
if (state != DCCP_ACKVEC_STATE_NOT_RECEIVED &&
|
2006-03-21 02:41:47 +01:00
|
|
|
!seqp->ccid2s_acked) {
|
2008-09-09 13:27:22 +02:00
|
|
|
if (state ==
|
|
|
|
DCCP_ACKVEC_STATE_ECN_MARKED) {
|
2007-11-25 00:40:24 +01:00
|
|
|
ccid2_congestion_event(sk,
|
2006-09-19 22:14:43 +02:00
|
|
|
seqp);
|
2008-09-09 13:27:22 +02:00
|
|
|
} else
|
2006-03-21 02:41:47 +01:00
|
|
|
ccid2_new_ack(sk, seqp,
|
|
|
|
&maxincr);
|
|
|
|
|
|
|
|
seqp->ccid2s_acked = 1;
|
|
|
|
ccid2_pr_debug("Got ack for %llu\n",
|
2006-10-30 01:03:30 +01:00
|
|
|
(unsigned long long)seqp->ccid2s_seq);
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_hc_tx_dec_pipe(sk);
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
2009-10-05 02:53:10 +02:00
|
|
|
if (seqp == hctx->tx_seqt) {
|
2006-03-21 02:41:47 +01:00
|
|
|
done = 1;
|
|
|
|
break;
|
|
|
|
}
|
2007-11-24 23:37:48 +01:00
|
|
|
seqp = seqp->ccid2s_prev;
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
|
|
|
if (done)
|
|
|
|
break;
|
|
|
|
|
2007-11-24 23:43:59 +01:00
|
|
|
ackno = SUB48(ackno_end_rl, 1);
|
2008-09-09 13:27:22 +02:00
|
|
|
vector++;
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
|
|
|
if (done)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* The state about what is acked should be correct now
|
|
|
|
* Check for NUMDUPACK
|
|
|
|
*/
|
2009-10-05 02:53:10 +02:00
|
|
|
seqp = hctx->tx_seqt;
|
|
|
|
while (before48(seqp->ccid2s_seq, hctx->tx_high_ack)) {
|
2006-11-16 17:28:40 +01:00
|
|
|
seqp = seqp->ccid2s_next;
|
2009-10-05 02:53:10 +02:00
|
|
|
if (seqp == hctx->tx_seqh) {
|
|
|
|
seqp = hctx->tx_seqh->ccid2s_prev;
|
2006-11-16 17:28:40 +01:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2006-03-21 02:41:47 +01:00
|
|
|
done = 0;
|
|
|
|
while (1) {
|
|
|
|
if (seqp->ccid2s_acked) {
|
|
|
|
done++;
|
2007-11-25 01:04:35 +01:00
|
|
|
if (done == NUMDUPACK)
|
2006-03-21 02:41:47 +01:00
|
|
|
break;
|
|
|
|
}
|
2009-10-05 02:53:10 +02:00
|
|
|
if (seqp == hctx->tx_seqt)
|
2006-03-21 02:41:47 +01:00
|
|
|
break;
|
|
|
|
seqp = seqp->ccid2s_prev;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* If there are at least 3 acknowledgements, anything unacknowledged
|
|
|
|
* below the last sequence number is considered lost
|
|
|
|
*/
|
2007-11-25 01:04:35 +01:00
|
|
|
if (done == NUMDUPACK) {
|
2006-03-21 02:41:47 +01:00
|
|
|
struct ccid2_seq *last_acked = seqp;
|
|
|
|
|
|
|
|
/* check for lost packets */
|
|
|
|
while (1) {
|
|
|
|
if (!seqp->ccid2s_acked) {
|
2006-09-19 22:14:43 +02:00
|
|
|
ccid2_pr_debug("Packet lost: %llu\n",
|
2006-10-30 01:03:30 +01:00
|
|
|
(unsigned long long)seqp->ccid2s_seq);
|
2006-09-19 22:14:43 +02:00
|
|
|
/* XXX need to traverse from tail -> head in
|
|
|
|
* order to detect multiple congestion events in
|
|
|
|
* one ack vector.
|
|
|
|
*/
|
2007-11-25 00:40:24 +01:00
|
|
|
ccid2_congestion_event(sk, seqp);
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_hc_tx_dec_pipe(sk);
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
2009-10-05 02:53:10 +02:00
|
|
|
if (seqp == hctx->tx_seqt)
|
2006-03-21 02:41:47 +01:00
|
|
|
break;
|
|
|
|
seqp = seqp->ccid2s_prev;
|
|
|
|
}
|
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_seqt = last_acked;
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/* trim acked packets in tail */
|
2009-10-05 02:53:10 +02:00
|
|
|
while (hctx->tx_seqt != hctx->tx_seqh) {
|
|
|
|
if (!hctx->tx_seqt->ccid2s_acked)
|
2006-03-21 02:41:47 +01:00
|
|
|
break;
|
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_seqt = hctx->tx_seqt->ccid2s_next;
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_hc_tx_check_sanity(hctx);
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
|
|
|
|
2006-03-21 04:21:44 +01:00
|
|
|
static int ccid2_hc_tx_init(struct ccid *ccid, struct sock *sk)
|
2006-03-21 02:41:47 +01:00
|
|
|
{
|
2007-02-09 15:24:38 +01:00
|
|
|
struct ccid2_hc_tx_sock *hctx = ccid_priv(ccid);
|
2007-11-25 00:44:30 +01:00
|
|
|
struct dccp_sock *dp = dccp_sk(sk);
|
|
|
|
u32 max_ratio;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2007-11-25 00:44:30 +01:00
|
|
|
/* RFC 4341, 5: initialise ssthresh to arbitrarily high (max) value */
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_ssthresh = ~0U;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
/*
|
|
|
|
* RFC 4341, 5: "The cwnd parameter is initialized to at most four
|
|
|
|
* packets for new connections, following the rules from [RFC3390]".
|
|
|
|
* We need to convert the bytes of RFC3390 into the packets of RFC 4341.
|
|
|
|
*/
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_cwnd = clamp(4380U / dp->dccps_mss_cache, 2U, 4U);
|
2007-11-25 00:44:30 +01:00
|
|
|
|
|
|
|
/* Make sure that Ack Ratio is enabled and within bounds. */
|
2009-10-05 02:53:10 +02:00
|
|
|
max_ratio = DIV_ROUND_UP(hctx->tx_cwnd, 2);
|
2007-11-25 00:44:30 +01:00
|
|
|
if (dp->dccps_l_ack_ratio == 0 || dp->dccps_l_ack_ratio > max_ratio)
|
|
|
|
dp->dccps_l_ack_ratio = max_ratio;
|
|
|
|
|
2006-03-21 02:41:47 +01:00
|
|
|
/* XXX init ~ to window size... */
|
2007-10-04 23:41:00 +02:00
|
|
|
if (ccid2_hc_tx_alloc_seq(hctx))
|
2006-03-21 02:41:47 +01:00
|
|
|
return -ENOMEM;
|
2006-03-21 04:21:44 +01:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_rto = 3 * HZ;
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_change_srtt(hctx, -1);
|
2009-10-05 02:53:10 +02:00
|
|
|
hctx->tx_rttvar = -1;
|
|
|
|
hctx->tx_rpdupack = -1;
|
|
|
|
hctx->tx_last_cong = jiffies;
|
|
|
|
setup_timer(&hctx->tx_rtotimer, ccid2_hc_tx_rto_expire,
|
2008-09-09 13:27:22 +02:00
|
|
|
(unsigned long)sk);
|
|
|
|
|
|
|
|
ccid2_hc_tx_check_sanity(hctx);
|
2006-03-21 02:41:47 +01:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void ccid2_hc_tx_exit(struct sock *sk)
|
|
|
|
{
|
2007-02-09 15:24:38 +01:00
|
|
|
struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
|
2006-09-19 22:13:37 +02:00
|
|
|
int i;
|
2006-03-21 02:41:47 +01:00
|
|
|
|
2008-09-09 13:27:22 +02:00
|
|
|
ccid2_hc_tx_kill_rto_timer(sk);
|
2006-09-19 22:13:37 +02:00
|
|
|
|
2009-10-05 02:53:10 +02:00
|
|
|
for (i = 0; i < hctx->tx_seqbufc; i++)
|
|
|
|
kfree(hctx->tx_seqbuf[i]);
|
|
|
|
hctx->tx_seqbufc = 0;
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static void ccid2_hc_rx_packet_recv(struct sock *sk, struct sk_buff *skb)
|
|
|
|
{
|
|
|
|
const struct dccp_sock *dp = dccp_sk(sk);
|
|
|
|
struct ccid2_hc_rx_sock *hcrx = ccid2_hc_rx_sk(sk);
|
|
|
|
|
|
|
|
switch (DCCP_SKB_CB(skb)->dccpd_type) {
|
|
|
|
case DCCP_PKT_DATA:
|
|
|
|
case DCCP_PKT_DATAACK:
|
2009-10-05 02:53:10 +02:00
|
|
|
hcrx->rx_data++;
|
|
|
|
if (hcrx->rx_data >= dp->dccps_r_ack_ratio) {
|
2006-03-21 02:41:47 +01:00
|
|
|
dccp_send_ack(sk);
|
2009-10-05 02:53:10 +02:00
|
|
|
hcrx->rx_data = 0;
|
2006-03-21 02:41:47 +01:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-01-05 06:42:53 +01:00
|
|
|
struct ccid_operations ccid2_ops = {
|
2008-09-09 13:27:22 +02:00
|
|
|
.ccid_id = DCCPC_CCID2,
|
|
|
|
.ccid_name = "TCP-like",
|
|
|
|
.ccid_hc_tx_obj_size = sizeof(struct ccid2_hc_tx_sock),
|
|
|
|
.ccid_hc_tx_init = ccid2_hc_tx_init,
|
|
|
|
.ccid_hc_tx_exit = ccid2_hc_tx_exit,
|
|
|
|
.ccid_hc_tx_send_packet = ccid2_hc_tx_send_packet,
|
|
|
|
.ccid_hc_tx_packet_sent = ccid2_hc_tx_packet_sent,
|
|
|
|
.ccid_hc_tx_packet_recv = ccid2_hc_tx_packet_recv,
|
|
|
|
.ccid_hc_rx_obj_size = sizeof(struct ccid2_hc_rx_sock),
|
|
|
|
.ccid_hc_rx_packet_recv = ccid2_hc_rx_packet_recv,
|
2006-03-21 02:41:47 +01:00
|
|
|
};
|
|
|
|
|
2006-11-20 21:26:03 +01:00
|
|
|
#ifdef CONFIG_IP_DCCP_CCID2_DEBUG
|
2008-08-23 13:28:27 +02:00
|
|
|
module_param(ccid2_debug, bool, 0644);
|
2009-01-05 06:42:53 +01:00
|
|
|
MODULE_PARM_DESC(ccid2_debug, "Enable CCID-2 debug messages");
|
2006-11-20 21:26:03 +01:00
|
|
|
#endif
|