Techwizz/kernel-fxtec-pro1x
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

dccp ccid-2: Ack Vector interface clean-up

Browse source 
This patch brings the Ack Vector interface up to date. Its main purpose is
to lay the basis for the subsequent patches of this set, which will use the
new data structure fields and routines.

There are no real algorithmic changes, rather an adaptation:

 (1) Replaced the static Ack Vector size (2) with a #define so that it can
     be adapted (with low loss / Ack Ratio, a value of 1 works, so 2 seems
     to be sufficient for the moment) and added a solution so that computing
     the ECN nonce will continue to work - even with larger Ack Vectors.

 (2) Replaced the #defines for Ack Vector states with a complete enum.

 (3) Replaced #defines to compute Ack Vector length and state with general
     purpose routines (inlines), and updated code to use these.

 (4) Added a `tail' field (conversion to circular buffer in subsequent patch).

 (5) Updated the (outdated) documentation for Ack Vector struct.

 (6) All sequence number containers now trimmed to 48 bits.

 (7) Removal of unused bits:
     * removed dccpav_ack_nonce from struct dccp_ackvec, since this is already
       redundantly stored in the `dccpavr_ack_nonce' (of Ack Vector record);
     * removed Elapsed Time for Ack Vectors (it was nowhere used);
     * replaced semantics of dccpavr_sent_len with dccpavr_ack_runlen, since
       the code needs to be able to remember the old run length; 
     * reduced the de-/allocation routines (redundant / duplicate tests).


Justification for removing Elapsed Time information [can be removed]:
---------------------------------------------------------------------
 1. The Elapsed Time information for Ack Vectors was nowhere used in the code.
 2. DCCP does not implement rate-based pacing of acknowledgments. The only
    recommendation for always including Elapsed Time is in section 11.3 of
    RFC 4340: "Receivers that rate-pace acknowledgements SHOULD [...]
    include Elapsed Time options". But such is not the case here.
 3. It does not really improve estimation accuracy. The Elapsed Time field only
    records the time between the arrival of the last acknowledgeable packet and
    the time the Ack Vector is sent out. Since Linux does not (yet) implement
    delayed Acks, the time difference will typically be small, since often the
    arrival of a data packet triggers sending feedback at the HC-receiver.


Justification for changes in de-/allocation routines [can be removed]:
----------------------------------------------------------------------
  * INIT_LIST_HEAD in dccp_ackvec_record_new was redundant, since the list
    pointers were later overwritten when the node was added via list_add();
  * dccp_ackvec_record_new() was called in a single place only;
  * calls to list_del_init() before calling dccp_ackvec_record_delete() were
    redundant, since subsequently the entire element was k-freed;
  * since all calls to dccp_ackvec_record_delete() were preceded to a call to
    list_del_init(), the WARN_ON test would never evaluate to true;
  * since all calls to dccp_ackvec_record_delete() were made from within
    list_for_each_entry_safe(), the test for avr == NULL was redundant;
  * list_empty() in ackvec_free was redundant, since the same condition is
    embedded in the loop condition of the subsequent list_for_each_entry_safe().

Signed-off-by: Gerrit Renker <gerrit@erg.abdn.ac.uk>
This commit is contained in:
Gerrit Renker 2008-09-04 07:30:19 +02:00
parent b8c6bcee1d
commit ff49e27089
4 changed files with 128 additions and 174 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

180
net/dccp/ackvec.c
View file

@ -1,7 +1,8 @@
/* /*
* net/dccp/ackvec.c * net/dccp/ackvec.c
* *
* An implementation of the DCCP protocol * An implementation of Ack Vectors for the DCCP protocol
* Copyright (c) 2007 University of Aberdeen, Scotland, UK
* Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@ghostprotocols.net> * Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@ghostprotocols.net>
* *
* This program is free software; you can redistribute it and/or modify it * This program is free software; you can redistribute it and/or modify it
@ -23,24 +24,32 @@
static struct kmem_cache *dccp_ackvec_slab; static struct kmem_cache *dccp_ackvec_slab;
static struct kmem_cache *dccp_ackvec_record_slab; static struct kmem_cache *dccp_ackvec_record_slab;
static struct dccp_ackvec_record *dccp_ackvec_record_new(void) struct dccp_ackvec *dccp_ackvec_alloc(const gfp_t priority)
{ {
struct dccp_ackvec_record *avr = struct dccp_ackvec *av = kmem_cache_zalloc(dccp_ackvec_slab, priority);
kmem_cache_alloc(dccp_ackvec_record_slab, GFP_ATOMIC);
if (avr != NULL) if (av != NULL) {
INIT_LIST_HEAD(&avr->avr_node); av->av_buf_head = DCCPAV_MAX_ACKVEC_LEN - 1;
INIT_LIST_HEAD(&av->av_records);
return avr; }
return av;
} }
static void dccp_ackvec_record_delete(struct dccp_ackvec_record *avr) static void dccp_ackvec_purge_records(struct dccp_ackvec *av)
{ {
if (unlikely(avr == NULL)) struct dccp_ackvec_record *cur, *next;
return;
/* Check if deleting a linked record */ list_for_each_entry_safe(cur, next, &av->av_records, avr_node)
WARN_ON(!list_empty(&avr->avr_node)); kmem_cache_free(dccp_ackvec_record_slab, cur);
kmem_cache_free(dccp_ackvec_record_slab, avr); INIT_LIST_HEAD(&av->av_records);
}
void dccp_ackvec_free(struct dccp_ackvec *av)
{
if (likely(av != NULL)) {
dccp_ackvec_purge_records(av);
kmem_cache_free(dccp_ackvec_slab, av);
}
} }
static void dccp_ackvec_insert_avr(struct dccp_ackvec *av, static void dccp_ackvec_insert_avr(struct dccp_ackvec *av,
@ -68,24 +77,16 @@ int dccp_insert_option_ackvec(struct sock *sk, struct sk_buff *skb)
struct dccp_ackvec *av = dp->dccps_hc_rx_ackvec; struct dccp_ackvec *av = dp->dccps_hc_rx_ackvec;
/* Figure out how many options do we need to represent the ackvec */ /* Figure out how many options do we need to represent the ackvec */
const u8 nr_opts = DIV_ROUND_UP(av->av_vec_len, DCCP_SINGLE_OPT_MAXLEN); const u8 nr_opts = DIV_ROUND_UP(av->av_vec_len, DCCP_SINGLE_OPT_MAXLEN);
u16 len = av->av_vec_len + 2 * nr_opts, i; u16 len = av->av_vec_len + 2 * nr_opts;
u32 elapsed_time; u8 i, nonce = 0;
const unsigned char *tail, *from; const unsigned char *tail, *from;
unsigned char *to; unsigned char *to;
struct dccp_ackvec_record *avr; struct dccp_ackvec_record *avr;
suseconds_t delta;
if (DCCP_SKB_CB(skb)->dccpd_opt_len + len > DCCP_MAX_OPT_LEN) if (DCCP_SKB_CB(skb)->dccpd_opt_len + len > DCCP_MAX_OPT_LEN)
return -1; return -1;
delta = ktime_us_delta(ktime_get_real(), av->av_time); avr = kmem_cache_alloc(dccp_ackvec_record_slab, GFP_ATOMIC);
elapsed_time = delta / 10;
if (elapsed_time != 0 &&
dccp_insert_option_elapsed_time(sk, skb, elapsed_time))
return -1;
avr = dccp_ackvec_record_new();
if (avr == NULL) if (avr == NULL)
return -1; return -1;
@ -94,7 +95,7 @@ int dccp_insert_option_ackvec(struct sock *sk, struct sk_buff *skb)
to = skb_push(skb, len); to = skb_push(skb, len);
len = av->av_vec_len; len = av->av_vec_len;
from = av->av_buf + av->av_buf_head; from = av->av_buf + av->av_buf_head;
tail = av->av_buf + DCCP_MAX_ACKVEC_LEN; tail = av->av_buf + DCCPAV_MAX_ACKVEC_LEN;
for (i = 0; i < nr_opts; ++i) { for (i = 0; i < nr_opts; ++i) {
int copylen = len; int copylen = len;
@ -102,7 +103,13 @@ int dccp_insert_option_ackvec(struct sock *sk, struct sk_buff *skb)
if (len > DCCP_SINGLE_OPT_MAXLEN) if (len > DCCP_SINGLE_OPT_MAXLEN)
copylen = DCCP_SINGLE_OPT_MAXLEN; copylen = DCCP_SINGLE_OPT_MAXLEN;
*to++ = DCCPO_ACK_VECTOR_0; /*
* RFC 4340, 12.2: Encode the Nonce Echo for this Ack Vector via
* its type; ack_nonce is the sum of all individual buf_nonce's.
*/
nonce ^= av->av_buf_nonce[i];
*to++ = DCCPO_ACK_VECTOR_0 + av->av_buf_nonce[i];
*to++ = copylen + 2; *to++ = copylen + 2;
/* Check if buf_head wraps */ /* Check if buf_head wraps */
@ -123,75 +130,24 @@ int dccp_insert_option_ackvec(struct sock *sk, struct sk_buff *skb)
} }
/* /*
* From RFC 4340, A.2: * Each sent Ack Vector is recorded in the list, as per A.2 of RFC 4340.
*
* For each acknowledgement it sends, the HC-Receiver will add an
* acknowledgement record. ack_seqno will equal the HC-Receiver
* sequence number it used for the ack packet; ack_ptr will equal
* buf_head; ack_ackno will equal buf_ackno; and ack_nonce will
* equal buf_nonce.
*/ */
avr->avr_ack_seqno = DCCP_SKB_CB(skb)->dccpd_seq; avr->avr_ack_seqno = DCCP_SKB_CB(skb)->dccpd_seq;
avr->avr_ack_ptr = av->av_buf_head; avr->avr_ack_ptr = av->av_buf_head;
avr->avr_ack_ackno = av->av_buf_ackno; avr->avr_ack_ackno = av->av_buf_ackno;
avr->avr_ack_nonce = av->av_buf_nonce; avr->avr_ack_nonce = nonce;
avr->avr_sent_len = av->av_vec_len; avr->avr_ack_runlen = dccp_ackvec_runlen(av->av_buf + av->av_buf_head);
dccp_ackvec_insert_avr(av, avr); dccp_ackvec_insert_avr(av, avr);
dccp_pr_debug("%s ACK Vector 0, len=%d, ack_seqno=%llu, " dccp_pr_debug("%s ACK Vector 0, len=%d, ack_seqno=%llu, "
"ack_ackno=%llu\n", "ack_ackno=%llu\n",
dccp_role(sk), avr->avr_sent_len, dccp_role(sk), avr->avr_ack_runlen,
(unsigned long long)avr->avr_ack_seqno, (unsigned long long)avr->avr_ack_seqno,
(unsigned long long)avr->avr_ack_ackno); (unsigned long long)avr->avr_ack_ackno);
return 0; return 0;
} }
struct dccp_ackvec *dccp_ackvec_alloc(const gfp_t priority)
{
struct dccp_ackvec *av = kmem_cache_alloc(dccp_ackvec_slab, priority);
if (av != NULL) {
av->av_buf_head = DCCP_MAX_ACKVEC_LEN - 1;
av->av_buf_ackno = UINT48_MAX + 1;
av->av_buf_nonce = 0;
av->av_time = ktime_set(0, 0);
av->av_vec_len = 0;
INIT_LIST_HEAD(&av->av_records);
}
return av;
}
void dccp_ackvec_free(struct dccp_ackvec *av)
{
if (unlikely(av == NULL))
return;
if (!list_empty(&av->av_records)) {
struct dccp_ackvec_record *avr, *next;
list_for_each_entry_safe(avr, next, &av->av_records, avr_node) {
list_del_init(&avr->avr_node);
dccp_ackvec_record_delete(avr);
}
}
kmem_cache_free(dccp_ackvec_slab, av);
}
static inline u8 dccp_ackvec_state(const struct dccp_ackvec *av,
const u32 index)
{
return av->av_buf[index] & DCCP_ACKVEC_STATE_MASK;
}
static inline u8 dccp_ackvec_len(const struct dccp_ackvec *av,
const u32 index)
{
return av->av_buf[index] & DCCP_ACKVEC_LEN_MASK;
}
/* /*
* If several packets are missing, the HC-Receiver may prefer to enter multiple * If several packets are missing, the HC-Receiver may prefer to enter multiple
* bytes with run length 0, rather than a single byte with a larger run length; * bytes with run length 0, rather than a single byte with a larger run length;
@ -204,7 +160,7 @@ static inline int dccp_ackvec_set_buf_head_state(struct dccp_ackvec *av,
unsigned int gap; unsigned int gap;
long new_head; long new_head;
if (av->av_vec_len + packets > DCCP_MAX_ACKVEC_LEN) if (av->av_vec_len + packets > DCCPAV_MAX_ACKVEC_LEN)
return -ENOBUFS; return -ENOBUFS;
gap = packets - 1; gap = packets - 1;
@ -212,18 +168,18 @@ static inline int dccp_ackvec_set_buf_head_state(struct dccp_ackvec *av,
if (new_head < 0) { if (new_head < 0) {
if (gap > 0) { if (gap > 0) {
memset(av->av_buf, DCCP_ACKVEC_STATE_NOT_RECEIVED, memset(av->av_buf, DCCPAV_NOT_RECEIVED,
gap + new_head + 1); gap + new_head + 1);
gap = -new_head; gap = -new_head;
} }
new_head += DCCP_MAX_ACKVEC_LEN; new_head += DCCPAV_MAX_ACKVEC_LEN;
} }
av->av_buf_head = new_head; av->av_buf_head = new_head;
if (gap > 0) if (gap > 0)
memset(av->av_buf + av->av_buf_head + 1, memset(av->av_buf + av->av_buf_head + 1,
DCCP_ACKVEC_STATE_NOT_RECEIVED, gap); DCCPAV_NOT_RECEIVED, gap);
av->av_buf[av->av_buf_head] = state; av->av_buf[av->av_buf_head] = state;
av->av_vec_len += packets; av->av_vec_len += packets;
@ -236,6 +192,8 @@ static inline int dccp_ackvec_set_buf_head_state(struct dccp_ackvec *av,
int dccp_ackvec_add(struct dccp_ackvec *av, const struct sock *sk, int dccp_ackvec_add(struct dccp_ackvec *av, const struct sock *sk,
const u64 ackno, const u8 state) const u64 ackno, const u8 state)
{ {
u8 *cur_head = av->av_buf + av->av_buf_head,
*buf_end = av->av_buf + DCCPAV_MAX_ACKVEC_LEN;
/* /*
* Check at the right places if the buffer is full, if it is, tell the * Check at the right places if the buffer is full, if it is, tell the
* caller to start dropping packets till the HC-Sender acks our ACK * caller to start dropping packets till the HC-Sender acks our ACK
@ -260,7 +218,7 @@ int dccp_ackvec_add(struct dccp_ackvec *av, const struct sock *sk,
/* See if this is the first ackno being inserted */ /* See if this is the first ackno being inserted */
if (av->av_vec_len == 0) { if (av->av_vec_len == 0) {
av->av_buf[av->av_buf_head] = state; *cur_head = state;
av->av_vec_len = 1; av->av_vec_len = 1;
} else if (after48(ackno, av->av_buf_ackno)) { } else if (after48(ackno, av->av_buf_ackno)) {
const u64 delta = dccp_delta_seqno(av->av_buf_ackno, ackno); const u64 delta = dccp_delta_seqno(av->av_buf_ackno, ackno);
@ -269,10 +227,9 @@ int dccp_ackvec_add(struct dccp_ackvec *av, const struct sock *sk,
* Look if the state of this packet is the same as the * Look if the state of this packet is the same as the
* previous ackno and if so if we can bump the head len. * previous ackno and if so if we can bump the head len.
*/ */
if (delta == 1 && if (delta == 1 && dccp_ackvec_state(cur_head) == state &&
dccp_ackvec_state(av, av->av_buf_head) == state && dccp_ackvec_runlen(cur_head) < DCCPAV_MAX_RUNLEN)
dccp_ackvec_len(av, av->av_buf_head) < DCCP_ACKVEC_LEN_MASK) *cur_head += 1;
av->av_buf[av->av_buf_head]++;
else if (dccp_ackvec_set_buf_head_state(av, delta, state)) else if (dccp_ackvec_set_buf_head_state(av, delta, state))
return -ENOBUFS; return -ENOBUFS;
} else { } else {
@ -285,21 +242,17 @@ int dccp_ackvec_add(struct dccp_ackvec *av, const struct sock *sk,
* could reduce the complexity of this scan.) * could reduce the complexity of this scan.)
*/ */
u64 delta = dccp_delta_seqno(ackno, av->av_buf_ackno); u64 delta = dccp_delta_seqno(ackno, av->av_buf_ackno);
u32 index = av->av_buf_head;
while (1) { while (1) {
const u8 len = dccp_ackvec_len(av, index); const u8 len = dccp_ackvec_runlen(cur_head);
const u8 av_state = dccp_ackvec_state(av, index);
/* /*
* valid packets not yet in av_buf have a reserved * valid packets not yet in av_buf have a reserved
* entry, with a len equal to 0. * entry, with a len equal to 0.
*/ */
if (av_state == DCCP_ACKVEC_STATE_NOT_RECEIVED && if (*cur_head == DCCPAV_NOT_RECEIVED && delta == 0) {
len == 0 && delta == 0) { /* Found our
reserved seat! */
dccp_pr_debug("Found %llu reserved seat!\n", dccp_pr_debug("Found %llu reserved seat!\n",
(unsigned long long)ackno); (unsigned long long)ackno);
av->av_buf[index] = state; *cur_head = state;
goto out; goto out;
} }
/* len == 0 means one packet */ /* len == 0 means one packet */
@ -307,13 +260,12 @@ int dccp_ackvec_add(struct dccp_ackvec *av, const struct sock *sk,
goto out_duplicate; goto out_duplicate;
delta -= len + 1; delta -= len + 1;
if (++index == DCCP_MAX_ACKVEC_LEN) if (++cur_head == buf_end)
index = 0; cur_head = av->av_buf;
} }
} }
av->av_buf_ackno = ackno; av->av_buf_ackno = ackno;
av->av_time = ktime_get_real();
out: out:
return 0; return 0;
@ -333,13 +285,13 @@ static void dccp_ackvec_throw_record(struct dccp_ackvec *av,
if (av->av_buf_head <= avr->avr_ack_ptr) if (av->av_buf_head <= avr->avr_ack_ptr)
av->av_vec_len = avr->avr_ack_ptr - av->av_buf_head; av->av_vec_len = avr->avr_ack_ptr - av->av_buf_head;
else else
av->av_vec_len = DCCP_MAX_ACKVEC_LEN - 1 - av->av_vec_len = DCCPAV_MAX_ACKVEC_LEN - 1 -
av->av_buf_head + avr->avr_ack_ptr; av->av_buf_head + avr->avr_ack_ptr;
/* free records */ /* free records */
list_for_each_entry_safe_from(avr, next, &av->av_records, avr_node) { list_for_each_entry_safe_from(avr, next, &av->av_records, avr_node) {
list_del_init(&avr->avr_node); list_del(&avr->avr_node);
dccp_ackvec_record_delete(avr); kmem_cache_free(dccp_ackvec_record_slab, avr);
} }
} }
@ -357,7 +309,7 @@ void dccp_ackvec_check_rcv_ackno(struct dccp_ackvec *av, struct sock *sk,
if (ackno == avr->avr_ack_seqno) { if (ackno == avr->avr_ack_seqno) {
dccp_pr_debug("%s ACK packet 0, len=%d, ack_seqno=%llu, " dccp_pr_debug("%s ACK packet 0, len=%d, ack_seqno=%llu, "
"ack_ackno=%llu, ACKED!\n", "ack_ackno=%llu, ACKED!\n",
dccp_role(sk), 1, dccp_role(sk), avr->avr_ack_runlen,
(unsigned long long)avr->avr_ack_seqno, (unsigned long long)avr->avr_ack_seqno,
(unsigned long long)avr->avr_ack_ackno); (unsigned long long)avr->avr_ack_ackno);
dccp_ackvec_throw_record(av, avr); dccp_ackvec_throw_record(av, avr);
@ -387,7 +339,7 @@ static void dccp_ackvec_check_rcv_ackvector(struct dccp_ackvec *av,
*/ */
avr = list_entry(av->av_records.next, struct dccp_ackvec_record, avr_node); avr = list_entry(av->av_records.next, struct dccp_ackvec_record, avr_node);
while (i--) { while (i--) {
const u8 rl = *vector & DCCP_ACKVEC_LEN_MASK; const u8 rl = dccp_ackvec_runlen(vector);
u64 ackno_end_rl; u64 ackno_end_rl;
dccp_set_seqno(&ackno_end_rl, *ackno - rl); dccp_set_seqno(&ackno_end_rl, *ackno - rl);
@ -404,8 +356,7 @@ static void dccp_ackvec_check_rcv_ackvector(struct dccp_ackvec *av,
break; break;
found: found:
if (between48(avr->avr_ack_seqno, ackno_end_rl, *ackno)) { if (between48(avr->avr_ack_seqno, ackno_end_rl, *ackno)) {
const u8 state = *vector & DCCP_ACKVEC_STATE_MASK; if (dccp_ackvec_state(vector) != DCCPAV_NOT_RECEIVED) {
if (state != DCCP_ACKVEC_STATE_NOT_RECEIVED) {
dccp_pr_debug("%s ACK vector 0, len=%d, " dccp_pr_debug("%s ACK vector 0, len=%d, "
"ack_seqno=%llu, ack_ackno=%llu, " "ack_seqno=%llu, ack_ackno=%llu, "
"ACKED!\n", "ACKED!\n",
@ -448,10 +399,9 @@ int __init dccp_ackvec_init(void)
if (dccp_ackvec_slab == NULL) if (dccp_ackvec_slab == NULL)
goto out_err; goto out_err;
dccp_ackvec_record_slab = dccp_ackvec_record_slab = kmem_cache_create("dccp_ackvec_record",
kmem_cache_create("dccp_ackvec_record", sizeof(struct dccp_ackvec_record),
sizeof(struct dccp_ackvec_record), 0, SLAB_HWCACHE_ALIGN, NULL);
0, SLAB_HWCACHE_ALIGN, NULL);
if (dccp_ackvec_record_slab == NULL) if (dccp_ackvec_record_slab == NULL)
goto out_destroy_slab; goto out_destroy_slab;

103
net/dccp/ackvec.h
View file

@ -3,9 +3,9 @@
/* /*
* net/dccp/ackvec.h * net/dccp/ackvec.h
* *
* An implementation of the DCCP protocol * An implementation of Ack Vectors for the DCCP protocol
* Copyright (c) 2007 University of Aberdeen, Scotland, UK
* Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@mandriva.com> * Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@mandriva.com>
*
* This program is free software; you can redistribute it and/or modify it * This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 as * under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation. * published by the Free Software Foundation.
@ -13,75 +13,84 @@
#include <linux/dccp.h> #include <linux/dccp.h>
#include <linux/compiler.h> #include <linux/compiler.h>
#include <linux/ktime.h>
#include <linux/list.h> #include <linux/list.h>
#include <linux/types.h> #include <linux/types.h>
/* We can spread an ack vector across multiple options */ /*
#define DCCP_MAX_ACKVEC_LEN (DCCP_SINGLE_OPT_MAXLEN * 2) * Ack Vector buffer space is static, in multiples of %DCCP_SINGLE_OPT_MAXLEN,
* the maximum size of a single Ack Vector. Setting %DCCPAV_NUM_ACKVECS to 1
* will be sufficient for most cases of low Ack Ratios, using a value of 2 gives
* more headroom if Ack Ratio is higher or when the sender acknowledges slowly.
*/
#define DCCPAV_NUM_ACKVECS 2
#define DCCPAV_MAX_ACKVEC_LEN (DCCP_SINGLE_OPT_MAXLEN * DCCPAV_NUM_ACKVECS)
/* Estimated minimum average Ack Vector length - used for updating MPS */ /* Estimated minimum average Ack Vector length - used for updating MPS */
#define DCCPAV_MIN_OPTLEN 16 #define DCCPAV_MIN_OPTLEN 16
#define DCCP_ACKVEC_STATE_RECEIVED 0 enum dccp_ackvec_states {
#define DCCP_ACKVEC_STATE_ECN_MARKED (1 << 6) DCCPAV_RECEIVED = 0x00,
#define DCCP_ACKVEC_STATE_NOT_RECEIVED (3 << 6) DCCPAV_ECN_MARKED = 0x40,
DCCPAV_RESERVED = 0x80,
DCCPAV_NOT_RECEIVED = 0xC0
};
#define DCCPAV_MAX_RUNLEN 0x3F
#define DCCP_ACKVEC_STATE_MASK 0xC0 /* 11000000 */ static inline u8 dccp_ackvec_runlen(const u8 *cell)
#define DCCP_ACKVEC_LEN_MASK 0x3F /* 00111111 */ {
return *cell & DCCPAV_MAX_RUNLEN;
}
/** struct dccp_ackvec - ack vector static inline u8 dccp_ackvec_state(const u8 *cell)
{
return *cell & ~DCCPAV_MAX_RUNLEN;
}
/** struct dccp_ackvec - Ack Vector main data structure
* *
* This data structure is the one defined in RFC 4340, Appendix A. * This implements a fixed-size circular buffer within an array and is largely
* based on Appendix A of RFC 4340.
* *
* @av_buf_head - circular buffer head * @av_buf: circular buffer storage area
* @av_buf_tail - circular buffer tail * @av_buf_head: head index; begin of live portion in @av_buf
* @av_buf_ackno - ack # of the most recent packet acknowledgeable in the * @av_buf_tail: tail index; first index _after_ the live portion in @av_buf
* buffer (i.e. %av_buf_head) * @av_buf_ackno: highest seqno of acknowledgeable packet recorded in @av_buf
* @av_buf_nonce - the one-bit sum of the ECN Nonces on all packets acked * @av_buf_nonce: ECN nonce sums, each covering subsequent segments of up to
* by the buffer with State 0 * %DCCP_SINGLE_OPT_MAXLEN cells in the live portion of @av_buf
* * @av_records: list of %dccp_ackvec_record (Ack Vectors sent previously)
* Additionally, the HC-Receiver must keep some information about the * @av_veclen: length of the live portion of @av_buf
* Ack Vectors it has recently sent. For each packet sent carrying an
* Ack Vector, it remembers four variables:
*
* @av_records - list of dccp_ackvec_record
* @av_ack_nonce - the one-bit sum of the ECN Nonces for all State 0.
*
* @av_time - the time in usecs
* @av_buf - circular buffer of acknowledgeable packets
*/ */
struct dccp_ackvec { struct dccp_ackvec {
u64 av_buf_ackno; u8 av_buf[DCCPAV_MAX_ACKVEC_LEN];
struct list_head av_records;
ktime_t av_time;
u16 av_buf_head; u16 av_buf_head;
u16 av_buf_tail;
u64 av_buf_ackno:48;
bool av_buf_nonce[DCCPAV_NUM_ACKVECS];
struct list_head av_records;
u16 av_vec_len; u16 av_vec_len;
u8 av_buf_nonce;
u8 av_ack_nonce;
u8 av_buf[DCCP_MAX_ACKVEC_LEN];
}; };
/** struct dccp_ackvec_record - ack vector record /** struct dccp_ackvec_record - Records information about sent Ack Vectors
* *
* ACK vector record as defined in Appendix A of spec. * These list entries define the additional information which the HC-Receiver
* keeps about recently-sent Ack Vectors; again refer to RFC 4340, Appendix A.
* *
* The list is sorted by avr_ack_seqno * @avr_node: the list node in @av_records
* @avr_ack_seqno: sequence number of the packet the Ack Vector was sent on
* @avr_ack_ackno: the Ack number that this record/Ack Vector refers to
* @avr_ack_ptr: pointer into @av_buf where this record starts
* @avr_ack_runlen: run length of @avr_ack_ptr at the time of sending
* @avr_ack_nonce: the sum of @av_buf_nonce's at the time this record was sent
* *
* @avr_node - node in av_records * The list as a whole is sorted in descending order by @avr_ack_seqno.
* @avr_ack_seqno - sequence number of the packet this record was sent on
* @avr_ack_ackno - sequence number being acknowledged
* @avr_ack_ptr - pointer into av_buf where this record starts
* @avr_ack_nonce - av_ack_nonce at the time this record was sent
* @avr_sent_len - lenght of the record in av_buf
*/ */
struct dccp_ackvec_record { struct dccp_ackvec_record {
struct list_head avr_node; struct list_head avr_node;
u64 avr_ack_seqno; u64 avr_ack_seqno:48;
u64 avr_ack_ackno; u64 avr_ack_ackno:48;
u16 avr_ack_ptr; u16 avr_ack_ptr;
u16 avr_sent_len; u8 avr_ack_runlen;
u8 avr_ack_nonce; u8 avr_ack_nonce:1;
}; };
struct sock; struct sock;

13
net/dccp/ccids/ccid2.c
View file

@ -580,8 +580,7 @@ static void ccid2_hc_tx_packet_recv(struct sock *sk, struct sk_buff *skb)
&vector, &veclen)) != -1) { &vector, &veclen)) != -1) {
/* go through this ack vector */ /* go through this ack vector */
while (veclen--) { while (veclen--) {
const u8 rl = *vector & DCCP_ACKVEC_LEN_MASK; u64 ackno_end_rl = SUB48(ackno, dccp_ackvec_runlen(vector));
u64 ackno_end_rl = SUB48(ackno, rl);
ccid2_pr_debug("ackvec start:%llu end:%llu\n", ccid2_pr_debug("ackvec start:%llu end:%llu\n",
(unsigned long long)ackno, (unsigned long long)ackno,
@ -604,17 +603,15 @@ static void ccid2_hc_tx_packet_recv(struct sock *sk, struct sk_buff *skb)
* run length * run length
*/ */
while (between48(seqp->ccid2s_seq,ackno_end_rl,ackno)) { while (between48(seqp->ccid2s_seq,ackno_end_rl,ackno)) {
const u8 state = *vector & const u8 state = dccp_ackvec_state(vector);
DCCP_ACKVEC_STATE_MASK;
/* new packet received or marked */ /* new packet received or marked */
if (state != DCCP_ACKVEC_STATE_NOT_RECEIVED && if (state != DCCPAV_NOT_RECEIVED &&
!seqp->ccid2s_acked) { !seqp->ccid2s_acked) {
if (state == if (state == DCCPAV_ECN_MARKED)
DCCP_ACKVEC_STATE_ECN_MARKED) {
ccid2_congestion_event(sk, ccid2_congestion_event(sk,
seqp); seqp);
} else else
ccid2_new_ack(sk, seqp, ccid2_new_ack(sk, seqp,
&maxincr); &maxincr);

6
net/dccp/input.c
View file

@ -377,8 +377,7 @@ int dccp_rcv_established(struct sock *sk, struct sk_buff *skb,
if (dp->dccps_hc_rx_ackvec != NULL && if (dp->dccps_hc_rx_ackvec != NULL &&
dccp_ackvec_add(dp->dccps_hc_rx_ackvec, sk, dccp_ackvec_add(dp->dccps_hc_rx_ackvec, sk,
DCCP_SKB_CB(skb)->dccpd_seq, DCCP_SKB_CB(skb)->dccpd_seq, DCCPAV_RECEIVED))
DCCP_ACKVEC_STATE_RECEIVED))
goto discard; goto discard;
dccp_deliver_input_to_ccids(sk, skb); dccp_deliver_input_to_ccids(sk, skb);
@ -627,8 +626,7 @@ int dccp_rcv_state_process(struct sock *sk, struct sk_buff *skb,
if (dp->dccps_hc_rx_ackvec != NULL && if (dp->dccps_hc_rx_ackvec != NULL &&
dccp_ackvec_add(dp->dccps_hc_rx_ackvec, sk, dccp_ackvec_add(dp->dccps_hc_rx_ackvec, sk,
DCCP_SKB_CB(skb)->dccpd_seq, DCCP_SKB_CB(skb)->dccpd_seq, DCCPAV_RECEIVED))
DCCP_ACKVEC_STATE_RECEIVED))
goto discard; goto discard;
dccp_deliver_input_to_ccids(sk, skb); dccp_deliver_input_to_ccids(sk, skb);