ackvec.h 4.5 KB

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