#ifndef _ACKVEC_H1#define _ACKVEC_H2/*3* net/dccp/ackvec.h4*5* An implementation of Ack Vectors for the DCCP protocol6* Copyright (c) 2007 University of Aberdeen, Scotland, UK7* Copyright (c) 2005 Arnaldo Carvalho de Melo <[email protected]>8* This program is free software; you can redistribute it and/or modify it9* under the terms of the GNU General Public License version 2 as10* published by the Free Software Foundation.11*/1213#include <linux/dccp.h>14#include <linux/compiler.h>15#include <linux/list.h>16#include <linux/types.h>1718/*19* Ack Vector buffer space is static, in multiples of %DCCP_SINGLE_OPT_MAXLEN,20* the maximum size of a single Ack Vector. Setting %DCCPAV_NUM_ACKVECS to 121* will be sufficient for most cases of low Ack Ratios, using a value of 2 gives22* more headroom if Ack Ratio is higher or when the sender acknowledges slowly.23* The maximum value is bounded by the u16 types for indices and functions.24*/25#define DCCPAV_NUM_ACKVECS 226#define DCCPAV_MAX_ACKVEC_LEN (DCCP_SINGLE_OPT_MAXLEN * DCCPAV_NUM_ACKVECS)2728/* Estimated minimum average Ack Vector length - used for updating MPS */29#define DCCPAV_MIN_OPTLEN 163031/* Threshold for coping with large bursts of losses */32#define DCCPAV_BURST_THRESH (DCCPAV_MAX_ACKVEC_LEN / 8)3334enum dccp_ackvec_states {35DCCPAV_RECEIVED = 0x00,36DCCPAV_ECN_MARKED = 0x40,37DCCPAV_RESERVED = 0x80,38DCCPAV_NOT_RECEIVED = 0xC039};40#define DCCPAV_MAX_RUNLEN 0x3F4142static inline u8 dccp_ackvec_runlen(const u8 *cell)43{44return *cell & DCCPAV_MAX_RUNLEN;45}4647static inline u8 dccp_ackvec_state(const u8 *cell)48{49return *cell & ~DCCPAV_MAX_RUNLEN;50}5152/** struct dccp_ackvec - Ack Vector main data structure53*54* This implements a fixed-size circular buffer within an array and is largely55* based on Appendix A of RFC 4340.56*57* @av_buf: circular buffer storage area58* @av_buf_head: head index; begin of live portion in @av_buf59* @av_buf_tail: tail index; first index _after_ the live portion in @av_buf60* @av_buf_ackno: highest seqno of acknowledgeable packet recorded in @av_buf61* @av_tail_ackno: lowest seqno of acknowledgeable packet recorded in @av_buf62* @av_buf_nonce: ECN nonce sums, each covering subsequent segments of up to63* %DCCP_SINGLE_OPT_MAXLEN cells in the live portion of @av_buf64* @av_overflow: if 1 then buf_head == buf_tail indicates buffer wraparound65* @av_records: list of %dccp_ackvec_record (Ack Vectors sent previously)66*/67struct dccp_ackvec {68u8 av_buf[DCCPAV_MAX_ACKVEC_LEN];69u16 av_buf_head;70u16 av_buf_tail;71u64 av_buf_ackno:48;72u64 av_tail_ackno:48;73bool av_buf_nonce[DCCPAV_NUM_ACKVECS];74u8 av_overflow:1;75struct list_head av_records;76};7778/** struct dccp_ackvec_record - Records information about sent Ack Vectors79*80* These list entries define the additional information which the HC-Receiver81* keeps about recently-sent Ack Vectors; again refer to RFC 4340, Appendix A.82*83* @avr_node: the list node in @av_records84* @avr_ack_seqno: sequence number of the packet the Ack Vector was sent on85* @avr_ack_ackno: the Ack number that this record/Ack Vector refers to86* @avr_ack_ptr: pointer into @av_buf where this record starts87* @avr_ack_runlen: run length of @avr_ack_ptr at the time of sending88* @avr_ack_nonce: the sum of @av_buf_nonce's at the time this record was sent89*90* The list as a whole is sorted in descending order by @avr_ack_seqno.91*/92struct dccp_ackvec_record {93struct list_head avr_node;94u64 avr_ack_seqno:48;95u64 avr_ack_ackno:48;96u16 avr_ack_ptr;97u8 avr_ack_runlen;98u8 avr_ack_nonce:1;99};100101extern int dccp_ackvec_init(void);102extern void dccp_ackvec_exit(void);103104extern struct dccp_ackvec *dccp_ackvec_alloc(const gfp_t priority);105extern void dccp_ackvec_free(struct dccp_ackvec *av);106107extern void dccp_ackvec_input(struct dccp_ackvec *av, struct sk_buff *skb);108extern int dccp_ackvec_update_records(struct dccp_ackvec *av, u64 seq, u8 sum);109extern void dccp_ackvec_clear_state(struct dccp_ackvec *av, const u64 ackno);110extern u16 dccp_ackvec_buflen(const struct dccp_ackvec *av);111112static inline bool dccp_ackvec_is_empty(const struct dccp_ackvec *av)113{114return av->av_overflow == 0 && av->av_buf_head == av->av_buf_tail;115}116117/**118* struct dccp_ackvec_parsed - Record offsets of Ack Vectors in skb119* @vec: start of vector (offset into skb)120* @len: length of @vec121* @nonce: whether @vec had an ECN nonce of 0 or 1122* @node: FIFO - arranged in descending order of ack_ackno123* This structure is used by CCIDs to access Ack Vectors in a received skb.124*/125struct dccp_ackvec_parsed {126u8 *vec,127len,128nonce:1;129struct list_head node;130};131132extern int dccp_ackvec_parsed_add(struct list_head *head,133u8 *vec, u8 len, u8 nonce);134extern void dccp_ackvec_parsed_cleanup(struct list_head *parsed_chunks);135#endif /* _ACKVEC_H */136137138