4 * An implementation of Ack Vectors for the DCCP protocol
5 * Copyright (c) 2007 University of Aberdeen, Scotland, UK
6 * Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@ghostprotocols.net>
8 * This program is free software; you can redistribute it and/or modify it
9 * under the terms of the GNU General Public License as published by the
10 * Free Software Foundation; version 2 of the License;
16 #include <linux/init.h>
17 #include <linux/errno.h>
18 #include <linux/kernel.h>
19 #include <linux/skbuff.h>
20 #include <linux/slab.h>
24 static struct kmem_cache
*dccp_ackvec_slab
;
25 static struct kmem_cache
*dccp_ackvec_record_slab
;
27 struct dccp_ackvec
*dccp_ackvec_alloc(const gfp_t priority
)
29 struct dccp_ackvec
*av
= kmem_cache_zalloc(dccp_ackvec_slab
, priority
);
32 av
->av_buf_head
= av
->av_buf_tail
= DCCPAV_MAX_ACKVEC_LEN
- 1;
33 INIT_LIST_HEAD(&av
->av_records
);
38 static void dccp_ackvec_purge_records(struct dccp_ackvec
*av
)
40 struct dccp_ackvec_record
*cur
, *next
;
42 list_for_each_entry_safe(cur
, next
, &av
->av_records
, avr_node
)
43 kmem_cache_free(dccp_ackvec_record_slab
, cur
);
44 INIT_LIST_HEAD(&av
->av_records
);
47 void dccp_ackvec_free(struct dccp_ackvec
*av
)
49 if (likely(av
!= NULL
)) {
50 dccp_ackvec_purge_records(av
);
51 kmem_cache_free(dccp_ackvec_slab
, av
);
56 * dccp_ackvec_update_records - Record information about sent Ack Vectors
57 * @av: Ack Vector records to update
58 * @seqno: Sequence number of the packet carrying the Ack Vector just sent
59 * @nonce_sum: The sum of all buffer nonces contained in the Ack Vector
61 int dccp_ackvec_update_records(struct dccp_ackvec
*av
, u64 seqno
, u8 nonce_sum
)
63 struct dccp_ackvec_record
*avr
;
65 avr
= kmem_cache_alloc(dccp_ackvec_record_slab
, GFP_ATOMIC
);
69 avr
->avr_ack_seqno
= seqno
;
70 avr
->avr_ack_ptr
= av
->av_buf_head
;
71 avr
->avr_ack_ackno
= av
->av_buf_ackno
;
72 avr
->avr_ack_nonce
= nonce_sum
;
73 avr
->avr_ack_runlen
= dccp_ackvec_runlen(av
->av_buf
+ av
->av_buf_head
);
75 * When the buffer overflows, we keep no more than one record. This is
76 * the simplest way of disambiguating sender-Acks dating from before the
77 * overflow from sender-Acks which refer to after the overflow; a simple
78 * solution is preferable here since we are handling an exception.
81 dccp_ackvec_purge_records(av
);
83 * Since GSS is incremented for each packet, the list is automatically
84 * arranged in descending order of @ack_seqno.
86 list_add(&avr
->avr_node
, &av
->av_records
);
88 dccp_pr_debug("Added Vector, ack_seqno=%llu, ack_ackno=%llu (rl=%u)\n",
89 (unsigned long long)avr
->avr_ack_seqno
,
90 (unsigned long long)avr
->avr_ack_ackno
,
95 static struct dccp_ackvec_record
*dccp_ackvec_lookup(struct list_head
*av_list
,
98 struct dccp_ackvec_record
*avr
;
100 * Exploit that records are inserted in descending order of sequence
101 * number, start with the oldest record first. If @ackno is `before'
102 * the earliest ack_ackno, the packet is too old to be considered.
104 list_for_each_entry_reverse(avr
, av_list
, avr_node
) {
105 if (avr
->avr_ack_seqno
== ackno
)
107 if (before48(ackno
, avr
->avr_ack_seqno
))
114 * Buffer index and length computation using modulo-buffersize arithmetic.
115 * Note that, as pointers move from right to left, head is `before' tail.
117 static inline u16
__ackvec_idx_add(const u16 a
, const u16 b
)
119 return (a
+ b
) % DCCPAV_MAX_ACKVEC_LEN
;
122 static inline u16
__ackvec_idx_sub(const u16 a
, const u16 b
)
124 return __ackvec_idx_add(a
, DCCPAV_MAX_ACKVEC_LEN
- b
);
127 u16
dccp_ackvec_buflen(const struct dccp_ackvec
*av
)
129 if (unlikely(av
->av_overflow
))
130 return DCCPAV_MAX_ACKVEC_LEN
;
131 return __ackvec_idx_sub(av
->av_buf_tail
, av
->av_buf_head
);
135 * If several packets are missing, the HC-Receiver may prefer to enter multiple
136 * bytes with run length 0, rather than a single byte with a larger run length;
137 * this simplifies table updates if one of the missing packets arrives.
139 static inline int dccp_ackvec_set_buf_head_state(struct dccp_ackvec
*av
,
140 const unsigned int packets
,
141 const unsigned char state
)
146 if (av
->av_vec_len
+ packets
> DCCPAV_MAX_ACKVEC_LEN
)
150 new_head
= av
->av_buf_head
- packets
;
154 memset(av
->av_buf
, DCCPAV_NOT_RECEIVED
,
158 new_head
+= DCCPAV_MAX_ACKVEC_LEN
;
161 av
->av_buf_head
= new_head
;
164 memset(av
->av_buf
+ av
->av_buf_head
+ 1,
165 DCCPAV_NOT_RECEIVED
, gap
);
167 av
->av_buf
[av
->av_buf_head
] = state
;
168 av
->av_vec_len
+= packets
;
173 * Implements the RFC 4340, Appendix A
175 int dccp_ackvec_add(struct dccp_ackvec
*av
, const struct sock
*sk
,
176 const u64 ackno
, const u8 state
)
178 u8
*cur_head
= av
->av_buf
+ av
->av_buf_head
,
179 *buf_end
= av
->av_buf
+ DCCPAV_MAX_ACKVEC_LEN
;
181 * Check at the right places if the buffer is full, if it is, tell the
182 * caller to start dropping packets till the HC-Sender acks our ACK
183 * vectors, when we will free up space in av_buf.
185 * We may well decide to do buffer compression, etc, but for now lets
188 * From Appendix A.1.1 (`New Packets'):
190 * Of course, the circular buffer may overflow, either when the
191 * HC-Sender is sending data at a very high rate, when the
192 * HC-Receiver's acknowledgements are not reaching the HC-Sender,
193 * or when the HC-Sender is forgetting to acknowledge those acks
194 * (so the HC-Receiver is unable to clean up old state). In this
195 * case, the HC-Receiver should either compress the buffer (by
196 * increasing run lengths when possible), transfer its state to
197 * a larger buffer, or, as a last resort, drop all received
198 * packets, without processing them whatsoever, until its buffer
202 /* See if this is the first ackno being inserted */
203 if (av
->av_vec_len
== 0) {
206 } else if (after48(ackno
, av
->av_buf_ackno
)) {
207 const u64 delta
= dccp_delta_seqno(av
->av_buf_ackno
, ackno
);
210 * Look if the state of this packet is the same as the
211 * previous ackno and if so if we can bump the head len.
213 if (delta
== 1 && dccp_ackvec_state(cur_head
) == state
&&
214 dccp_ackvec_runlen(cur_head
) < DCCPAV_MAX_RUNLEN
)
216 else if (dccp_ackvec_set_buf_head_state(av
, delta
, state
))
222 * When a packet with Sequence Number S <= buf_ackno
223 * arrives, the HC-Receiver will scan the table for
224 * the byte corresponding to S. (Indexing structures
225 * could reduce the complexity of this scan.)
227 u64 delta
= dccp_delta_seqno(ackno
, av
->av_buf_ackno
);
230 const u8 len
= dccp_ackvec_runlen(cur_head
);
232 * valid packets not yet in av_buf have a reserved
233 * entry, with a len equal to 0.
235 if (*cur_head
== DCCPAV_NOT_RECEIVED
&& delta
== 0) {
236 dccp_pr_debug("Found %llu reserved seat!\n",
237 (unsigned long long)ackno
);
241 /* len == 0 means one packet */
246 if (++cur_head
== buf_end
)
247 cur_head
= av
->av_buf
;
251 av
->av_buf_ackno
= ackno
;
256 /* Duplicate packet */
257 dccp_pr_debug("Received a dup or already considered lost "
258 "packet: %llu\n", (unsigned long long)ackno
);
262 static void dccp_ackvec_throw_record(struct dccp_ackvec
*av
,
263 struct dccp_ackvec_record
*avr
)
265 struct dccp_ackvec_record
*next
;
267 /* sort out vector length */
268 if (av
->av_buf_head
<= avr
->avr_ack_ptr
)
269 av
->av_vec_len
= avr
->avr_ack_ptr
- av
->av_buf_head
;
271 av
->av_vec_len
= DCCPAV_MAX_ACKVEC_LEN
- 1 -
272 av
->av_buf_head
+ avr
->avr_ack_ptr
;
275 list_for_each_entry_safe_from(avr
, next
, &av
->av_records
, avr_node
) {
276 list_del(&avr
->avr_node
);
277 kmem_cache_free(dccp_ackvec_record_slab
, avr
);
281 void dccp_ackvec_check_rcv_ackno(struct dccp_ackvec
*av
, struct sock
*sk
,
284 struct dccp_ackvec_record
*avr
;
287 * If we traverse backwards, it should be faster when we have large
288 * windows. We will be receiving ACKs for stuff we sent a while back
291 list_for_each_entry_reverse(avr
, &av
->av_records
, avr_node
) {
292 if (ackno
== avr
->avr_ack_seqno
) {
293 dccp_pr_debug("%s ACK packet 0, len=%d, ack_seqno=%llu, "
294 "ack_ackno=%llu, ACKED!\n",
295 dccp_role(sk
), avr
->avr_ack_runlen
,
296 (unsigned long long)avr
->avr_ack_seqno
,
297 (unsigned long long)avr
->avr_ack_ackno
);
298 dccp_ackvec_throw_record(av
, avr
);
300 } else if (avr
->avr_ack_seqno
> ackno
)
301 break; /* old news */
305 static void dccp_ackvec_check_rcv_ackvector(struct dccp_ackvec
*av
,
306 struct sock
*sk
, u64
*ackno
,
307 const unsigned char len
,
308 const unsigned char *vector
)
311 struct dccp_ackvec_record
*avr
;
313 /* Check if we actually sent an ACK vector */
314 if (list_empty(&av
->av_records
))
320 * I think it might be more efficient to work backwards. See comment on
323 avr
= list_entry(av
->av_records
.next
, struct dccp_ackvec_record
, avr_node
);
325 const u8 rl
= dccp_ackvec_runlen(vector
);
328 dccp_set_seqno(&ackno_end_rl
, *ackno
- rl
);
331 * If our AVR sequence number is greater than the ack, go
332 * forward in the AVR list until it is not so.
334 list_for_each_entry_from(avr
, &av
->av_records
, avr_node
) {
335 if (!after48(avr
->avr_ack_seqno
, *ackno
))
338 /* End of the av_records list, not found, exit */
341 if (between48(avr
->avr_ack_seqno
, ackno_end_rl
, *ackno
)) {
342 if (dccp_ackvec_state(vector
) != DCCPAV_NOT_RECEIVED
) {
343 dccp_pr_debug("%s ACK vector 0, len=%d, "
344 "ack_seqno=%llu, ack_ackno=%llu, "
351 dccp_ackvec_throw_record(av
, avr
);
355 * If it wasn't received, continue scanning... we might
360 dccp_set_seqno(ackno
, ackno_end_rl
- 1);
365 int dccp_ackvec_parse(struct sock
*sk
, const struct sk_buff
*skb
,
366 u64
*ackno
, const u8 opt
, const u8
*value
, const u8 len
)
368 if (len
> DCCP_SINGLE_OPT_MAXLEN
)
371 /* dccp_ackvector_print(DCCP_SKB_CB(skb)->dccpd_ack_seq, value, len); */
372 dccp_ackvec_check_rcv_ackvector(dccp_sk(sk
)->dccps_hc_rx_ackvec
, sk
,
378 * dccp_ackvec_clear_state - Perform house-keeping / garbage-collection
379 * This routine is called when the peer acknowledges the receipt of Ack Vectors
380 * up to and including @ackno. While based on on section A.3 of RFC 4340, here
381 * are additional precautions to prevent corrupted buffer state. In particular,
382 * we use tail_ackno to identify outdated records; it always marks the earliest
383 * packet of group (2) in 11.4.2.
385 void dccp_ackvec_clear_state(struct dccp_ackvec
*av
, const u64 ackno
)
387 struct dccp_ackvec_record
*avr
, *next
;
388 u8 runlen_now
, eff_runlen
;
391 avr
= dccp_ackvec_lookup(&av
->av_records
, ackno
);
395 * Deal with outdated acknowledgments: this arises when e.g. there are
396 * several old records and the acks from the peer come in slowly. In
397 * that case we may still have records that pre-date tail_ackno.
399 delta
= dccp_delta_seqno(av
->av_tail_ackno
, avr
->avr_ack_ackno
);
403 * Deal with overlapping Ack Vectors: don't subtract more than the
404 * number of packets between tail_ackno and ack_ackno.
406 eff_runlen
= delta
< avr
->avr_ack_runlen
? delta
: avr
->avr_ack_runlen
;
408 runlen_now
= dccp_ackvec_runlen(av
->av_buf
+ avr
->avr_ack_ptr
);
410 * The run length of Ack Vector cells does not decrease over time. If
411 * the run length is the same as at the time the Ack Vector was sent, we
412 * free the ack_ptr cell. That cell can however not be freed if the run
413 * length has increased: in this case we need to move the tail pointer
414 * backwards (towards higher indices), to its next-oldest neighbour.
416 if (runlen_now
> eff_runlen
) {
418 av
->av_buf
[avr
->avr_ack_ptr
] -= eff_runlen
+ 1;
419 av
->av_buf_tail
= __ackvec_idx_add(avr
->avr_ack_ptr
, 1);
421 /* This move may not have cleared the overflow flag. */
423 av
->av_overflow
= (av
->av_buf_head
== av
->av_buf_tail
);
425 av
->av_buf_tail
= avr
->avr_ack_ptr
;
427 * We have made sure that avr points to a valid cell within the
428 * buffer. This cell is either older than head, or equals head
429 * (empty buffer): in both cases we no longer have any overflow.
435 * The peer has acknowledged up to and including ack_ackno. Hence the
436 * first packet in group (2) of 11.4.2 is the successor of ack_ackno.
438 av
->av_tail_ackno
= ADD48(avr
->avr_ack_ackno
, 1);
441 list_for_each_entry_safe_from(avr
, next
, &av
->av_records
, avr_node
) {
442 list_del(&avr
->avr_node
);
443 kmem_cache_free(dccp_ackvec_record_slab
, avr
);
447 int __init
dccp_ackvec_init(void)
449 dccp_ackvec_slab
= kmem_cache_create("dccp_ackvec",
450 sizeof(struct dccp_ackvec
), 0,
451 SLAB_HWCACHE_ALIGN
, NULL
);
452 if (dccp_ackvec_slab
== NULL
)
455 dccp_ackvec_record_slab
= kmem_cache_create("dccp_ackvec_record",
456 sizeof(struct dccp_ackvec_record
),
457 0, SLAB_HWCACHE_ALIGN
, NULL
);
458 if (dccp_ackvec_record_slab
== NULL
)
459 goto out_destroy_slab
;
464 kmem_cache_destroy(dccp_ackvec_slab
);
465 dccp_ackvec_slab
= NULL
;
467 DCCP_CRIT("Unable to create Ack Vector slab cache");
471 void dccp_ackvec_exit(void)
473 if (dccp_ackvec_slab
!= NULL
) {
474 kmem_cache_destroy(dccp_ackvec_slab
);
475 dccp_ackvec_slab
= NULL
;
477 if (dccp_ackvec_record_slab
!= NULL
) {
478 kmem_cache_destroy(dccp_ackvec_record_slab
);
479 dccp_ackvec_record_slab
= NULL
;
This page took 0.041904 seconds and 6 git commands to generate.