Blame view
net/dccp/ackvec.h
4.66 KB
ae31c3399
|
1 2 3 4 5 |
#ifndef _ACKVEC_H #define _ACKVEC_H /* * net/dccp/ackvec.h * |
f17a37c9b
|
6 7 |
* An implementation of Ack Vectors for the DCCP protocol * Copyright (c) 2007 University of Aberdeen, Scotland, UK |
ae31c3399
|
8 |
* Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@mandriva.com> |
ae31c3399
|
9 10 11 12 |
* 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 * published by the Free Software Foundation. */ |
b20a9c24d
|
13 |
#include <linux/dccp.h> |
ae31c3399
|
14 |
#include <linux/compiler.h> |
02bcf28c8
|
15 |
#include <linux/list.h> |
ae31c3399
|
16 |
#include <linux/types.h> |
f17a37c9b
|
17 18 19 20 21 |
/* * 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. |
b3d14bff1
|
22 |
* The maximum value is bounded by the u16 types for indices and functions. |
f17a37c9b
|
23 24 25 |
*/ #define DCCPAV_NUM_ACKVECS 2 #define DCCPAV_MAX_ACKVEC_LEN (DCCP_SINGLE_OPT_MAXLEN * DCCPAV_NUM_ACKVECS) |
ae31c3399
|
26 |
|
361a5c1dd
|
27 28 |
/* Estimated minimum average Ack Vector length - used for updating MPS */ #define DCCPAV_MIN_OPTLEN 16 |
380240864
|
29 30 |
/* Threshold for coping with large bursts of losses */ #define DCCPAV_BURST_THRESH (DCCPAV_MAX_ACKVEC_LEN / 8) |
f17a37c9b
|
31 32 33 34 35 36 37 |
enum dccp_ackvec_states { DCCPAV_RECEIVED = 0x00, DCCPAV_ECN_MARKED = 0x40, DCCPAV_RESERVED = 0x80, DCCPAV_NOT_RECEIVED = 0xC0 }; #define DCCPAV_MAX_RUNLEN 0x3F |
ae31c3399
|
38 |
|
f17a37c9b
|
39 40 41 42 |
static inline u8 dccp_ackvec_runlen(const u8 *cell) { return *cell & DCCPAV_MAX_RUNLEN; } |
ae31c3399
|
43 |
|
f17a37c9b
|
44 45 46 47 |
static inline u8 dccp_ackvec_state(const u8 *cell) { return *cell & ~DCCPAV_MAX_RUNLEN; } |
2c53040f0
|
48 49 |
/** * struct dccp_ackvec - Ack Vector main data structure |
ae31c3399
|
50 |
* |
f17a37c9b
|
51 52 |
* This implements a fixed-size circular buffer within an array and is largely * based on Appendix A of RFC 4340. |
ae31c3399
|
53 |
* |
f17a37c9b
|
54 55 56 57 |
* @av_buf: circular buffer storage area * @av_buf_head: head index; begin of live portion in @av_buf * @av_buf_tail: tail index; first index _after_ the live portion in @av_buf * @av_buf_ackno: highest seqno of acknowledgeable packet recorded in @av_buf |
b3d14bff1
|
58 |
* @av_tail_ackno: lowest seqno of acknowledgeable packet recorded in @av_buf |
f17a37c9b
|
59 60 |
* @av_buf_nonce: ECN nonce sums, each covering subsequent segments of up to * %DCCP_SINGLE_OPT_MAXLEN cells in the live portion of @av_buf |
b3d14bff1
|
61 |
* @av_overflow: if 1 then buf_head == buf_tail indicates buffer wraparound |
f17a37c9b
|
62 |
* @av_records: list of %dccp_ackvec_record (Ack Vectors sent previously) |
ae31c3399
|
63 64 |
*/ struct dccp_ackvec { |
f17a37c9b
|
65 |
u8 av_buf[DCCPAV_MAX_ACKVEC_LEN]; |
a47c51044
|
66 |
u16 av_buf_head; |
f17a37c9b
|
67 68 |
u16 av_buf_tail; u64 av_buf_ackno:48; |
b3d14bff1
|
69 |
u64 av_tail_ackno:48; |
f17a37c9b
|
70 |
bool av_buf_nonce[DCCPAV_NUM_ACKVECS]; |
b3d14bff1
|
71 |
u8 av_overflow:1; |
f17a37c9b
|
72 |
struct list_head av_records; |
ae31c3399
|
73 |
}; |
2c53040f0
|
74 75 |
/** * struct dccp_ackvec_record - Records information about sent Ack Vectors |
02bcf28c8
|
76 |
* |
f17a37c9b
|
77 78 |
* These list entries define the additional information which the HC-Receiver * keeps about recently-sent Ack Vectors; again refer to RFC 4340, Appendix A. |
02bcf28c8
|
79 |
* |
f17a37c9b
|
80 81 82 83 84 85 |
* @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 |
02bcf28c8
|
86 |
* |
f17a37c9b
|
87 |
* The list as a whole is sorted in descending order by @avr_ack_seqno. |
02bcf28c8
|
88 89 |
*/ struct dccp_ackvec_record { |
a47c51044
|
90 |
struct list_head avr_node; |
f17a37c9b
|
91 92 |
u64 avr_ack_seqno:48; u64 avr_ack_ackno:48; |
a47c51044
|
93 |
u16 avr_ack_ptr; |
f17a37c9b
|
94 95 |
u8 avr_ack_runlen; u8 avr_ack_nonce:1; |
02bcf28c8
|
96 |
}; |
a402a5aa9
|
97 98 |
int dccp_ackvec_init(void); void dccp_ackvec_exit(void); |
9b07ef5dd
|
99 |
|
a402a5aa9
|
100 101 |
struct dccp_ackvec *dccp_ackvec_alloc(const gfp_t priority); void dccp_ackvec_free(struct dccp_ackvec *av); |
ae31c3399
|
102 |
|
a402a5aa9
|
103 104 105 106 |
void dccp_ackvec_input(struct dccp_ackvec *av, struct sk_buff *skb); int dccp_ackvec_update_records(struct dccp_ackvec *av, u64 seq, u8 sum); void dccp_ackvec_clear_state(struct dccp_ackvec *av, const u64 ackno); u16 dccp_ackvec_buflen(const struct dccp_ackvec *av); |
ae31c3399
|
107 |
|
b3d14bff1
|
108 |
static inline bool dccp_ackvec_is_empty(const struct dccp_ackvec *av) |
ae31c3399
|
109 |
{ |
b3d14bff1
|
110 |
return av->av_overflow == 0 && av->av_buf_head == av->av_buf_tail; |
ae31c3399
|
111 |
} |
7e87fe843
|
112 113 114 115 116 117 118 |
/** * struct dccp_ackvec_parsed - Record offsets of Ack Vectors in skb * @vec: start of vector (offset into skb) * @len: length of @vec * @nonce: whether @vec had an ECN nonce of 0 or 1 * @node: FIFO - arranged in descending order of ack_ackno |
2c53040f0
|
119 |
* |
7e87fe843
|
120 121 122 123 124 125 126 127 |
* This structure is used by CCIDs to access Ack Vectors in a received skb. */ struct dccp_ackvec_parsed { u8 *vec, len, nonce:1; struct list_head node; }; |
a402a5aa9
|
128 129 |
int dccp_ackvec_parsed_add(struct list_head *head, u8 *vec, u8 len, u8 nonce); void dccp_ackvec_parsed_cleanup(struct list_head *parsed_chunks); |
ae31c3399
|
130 |
#endif /* _ACKVEC_H */ |