162306a36Sopenharmony_ci/* SPDX-License-Identifier: GPL-2.0-or-later */ 262306a36Sopenharmony_ci/* 362306a36Sopenharmony_ci * Packet RX/TX history data structures and routines for TFRC-based protocols. 462306a36Sopenharmony_ci * 562306a36Sopenharmony_ci * Copyright (c) 2007 The University of Aberdeen, Scotland, UK 662306a36Sopenharmony_ci * Copyright (c) 2005-6 The University of Waikato, Hamilton, New Zealand. 762306a36Sopenharmony_ci * 862306a36Sopenharmony_ci * This code has been developed by the University of Waikato WAND 962306a36Sopenharmony_ci * research group. For further information please see https://www.wand.net.nz/ 1062306a36Sopenharmony_ci * or e-mail Ian McDonald - ian.mcdonald@jandi.co.nz 1162306a36Sopenharmony_ci * 1262306a36Sopenharmony_ci * This code also uses code from Lulea University, rereleased as GPL by its 1362306a36Sopenharmony_ci * authors: 1462306a36Sopenharmony_ci * Copyright (c) 2003 Nils-Erik Mattsson, Joacim Haggmark, Magnus Erixzon 1562306a36Sopenharmony_ci * 1662306a36Sopenharmony_ci * Changes to meet Linux coding standards, to make it meet latest ccid3 draft 1762306a36Sopenharmony_ci * and to make it work as a loadable module in the DCCP stack written by 1862306a36Sopenharmony_ci * Arnaldo Carvalho de Melo <acme@conectiva.com.br>. 1962306a36Sopenharmony_ci * 2062306a36Sopenharmony_ci * Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@conectiva.com.br> 2162306a36Sopenharmony_ci */ 2262306a36Sopenharmony_ci 2362306a36Sopenharmony_ci#ifndef _DCCP_PKT_HIST_ 2462306a36Sopenharmony_ci#define _DCCP_PKT_HIST_ 2562306a36Sopenharmony_ci 2662306a36Sopenharmony_ci#include <linux/list.h> 2762306a36Sopenharmony_ci#include <linux/slab.h> 2862306a36Sopenharmony_ci#include "tfrc.h" 2962306a36Sopenharmony_ci 3062306a36Sopenharmony_ci/** 3162306a36Sopenharmony_ci * tfrc_tx_hist_entry - Simple singly-linked TX history list 3262306a36Sopenharmony_ci * @next: next oldest entry (LIFO order) 3362306a36Sopenharmony_ci * @seqno: sequence number of this entry 3462306a36Sopenharmony_ci * @stamp: send time of packet with sequence number @seqno 3562306a36Sopenharmony_ci */ 3662306a36Sopenharmony_cistruct tfrc_tx_hist_entry { 3762306a36Sopenharmony_ci struct tfrc_tx_hist_entry *next; 3862306a36Sopenharmony_ci u64 seqno; 3962306a36Sopenharmony_ci ktime_t stamp; 4062306a36Sopenharmony_ci}; 4162306a36Sopenharmony_ci 4262306a36Sopenharmony_cistatic inline struct tfrc_tx_hist_entry * 4362306a36Sopenharmony_ci tfrc_tx_hist_find_entry(struct tfrc_tx_hist_entry *head, u64 seqno) 4462306a36Sopenharmony_ci{ 4562306a36Sopenharmony_ci while (head != NULL && head->seqno != seqno) 4662306a36Sopenharmony_ci head = head->next; 4762306a36Sopenharmony_ci return head; 4862306a36Sopenharmony_ci} 4962306a36Sopenharmony_ci 5062306a36Sopenharmony_ciint tfrc_tx_hist_add(struct tfrc_tx_hist_entry **headp, u64 seqno); 5162306a36Sopenharmony_civoid tfrc_tx_hist_purge(struct tfrc_tx_hist_entry **headp); 5262306a36Sopenharmony_ci 5362306a36Sopenharmony_ci/* Subtraction a-b modulo-16, respects circular wrap-around */ 5462306a36Sopenharmony_ci#define SUB16(a, b) (((a) + 16 - (b)) & 0xF) 5562306a36Sopenharmony_ci 5662306a36Sopenharmony_ci/* Number of packets to wait after a missing packet (RFC 4342, 6.1) */ 5762306a36Sopenharmony_ci#define TFRC_NDUPACK 3 5862306a36Sopenharmony_ci 5962306a36Sopenharmony_ci/** 6062306a36Sopenharmony_ci * tfrc_rx_hist_entry - Store information about a single received packet 6162306a36Sopenharmony_ci * @tfrchrx_seqno: DCCP packet sequence number 6262306a36Sopenharmony_ci * @tfrchrx_ccval: window counter value of packet (RFC 4342, 8.1) 6362306a36Sopenharmony_ci * @tfrchrx_ndp: the NDP count (if any) of the packet 6462306a36Sopenharmony_ci * @tfrchrx_tstamp: actual receive time of packet 6562306a36Sopenharmony_ci */ 6662306a36Sopenharmony_cistruct tfrc_rx_hist_entry { 6762306a36Sopenharmony_ci u64 tfrchrx_seqno:48, 6862306a36Sopenharmony_ci tfrchrx_ccval:4, 6962306a36Sopenharmony_ci tfrchrx_type:4; 7062306a36Sopenharmony_ci u64 tfrchrx_ndp:48; 7162306a36Sopenharmony_ci ktime_t tfrchrx_tstamp; 7262306a36Sopenharmony_ci}; 7362306a36Sopenharmony_ci 7462306a36Sopenharmony_ci/** 7562306a36Sopenharmony_ci * tfrc_rx_hist - RX history structure for TFRC-based protocols 7662306a36Sopenharmony_ci * @ring: Packet history for RTT sampling and loss detection 7762306a36Sopenharmony_ci * @loss_count: Number of entries in circular history 7862306a36Sopenharmony_ci * @loss_start: Movable index (for loss detection) 7962306a36Sopenharmony_ci * @rtt_sample_prev: Used during RTT sampling, points to candidate entry 8062306a36Sopenharmony_ci */ 8162306a36Sopenharmony_cistruct tfrc_rx_hist { 8262306a36Sopenharmony_ci struct tfrc_rx_hist_entry *ring[TFRC_NDUPACK + 1]; 8362306a36Sopenharmony_ci u8 loss_count:2, 8462306a36Sopenharmony_ci loss_start:2; 8562306a36Sopenharmony_ci#define rtt_sample_prev loss_start 8662306a36Sopenharmony_ci}; 8762306a36Sopenharmony_ci 8862306a36Sopenharmony_ci/** 8962306a36Sopenharmony_ci * tfrc_rx_hist_index - index to reach n-th entry after loss_start 9062306a36Sopenharmony_ci */ 9162306a36Sopenharmony_cistatic inline u8 tfrc_rx_hist_index(const struct tfrc_rx_hist *h, const u8 n) 9262306a36Sopenharmony_ci{ 9362306a36Sopenharmony_ci return (h->loss_start + n) & TFRC_NDUPACK; 9462306a36Sopenharmony_ci} 9562306a36Sopenharmony_ci 9662306a36Sopenharmony_ci/** 9762306a36Sopenharmony_ci * tfrc_rx_hist_last_rcv - entry with highest-received-seqno so far 9862306a36Sopenharmony_ci */ 9962306a36Sopenharmony_cistatic inline struct tfrc_rx_hist_entry * 10062306a36Sopenharmony_ci tfrc_rx_hist_last_rcv(const struct tfrc_rx_hist *h) 10162306a36Sopenharmony_ci{ 10262306a36Sopenharmony_ci return h->ring[tfrc_rx_hist_index(h, h->loss_count)]; 10362306a36Sopenharmony_ci} 10462306a36Sopenharmony_ci 10562306a36Sopenharmony_ci/** 10662306a36Sopenharmony_ci * tfrc_rx_hist_entry - return the n-th history entry after loss_start 10762306a36Sopenharmony_ci */ 10862306a36Sopenharmony_cistatic inline struct tfrc_rx_hist_entry * 10962306a36Sopenharmony_ci tfrc_rx_hist_entry(const struct tfrc_rx_hist *h, const u8 n) 11062306a36Sopenharmony_ci{ 11162306a36Sopenharmony_ci return h->ring[tfrc_rx_hist_index(h, n)]; 11262306a36Sopenharmony_ci} 11362306a36Sopenharmony_ci 11462306a36Sopenharmony_ci/** 11562306a36Sopenharmony_ci * tfrc_rx_hist_loss_prev - entry with highest-received-seqno before loss was detected 11662306a36Sopenharmony_ci */ 11762306a36Sopenharmony_cistatic inline struct tfrc_rx_hist_entry * 11862306a36Sopenharmony_ci tfrc_rx_hist_loss_prev(const struct tfrc_rx_hist *h) 11962306a36Sopenharmony_ci{ 12062306a36Sopenharmony_ci return h->ring[h->loss_start]; 12162306a36Sopenharmony_ci} 12262306a36Sopenharmony_ci 12362306a36Sopenharmony_ci/* indicate whether previously a packet was detected missing */ 12462306a36Sopenharmony_cistatic inline bool tfrc_rx_hist_loss_pending(const struct tfrc_rx_hist *h) 12562306a36Sopenharmony_ci{ 12662306a36Sopenharmony_ci return h->loss_count > 0; 12762306a36Sopenharmony_ci} 12862306a36Sopenharmony_ci 12962306a36Sopenharmony_civoid tfrc_rx_hist_add_packet(struct tfrc_rx_hist *h, const struct sk_buff *skb, 13062306a36Sopenharmony_ci const u64 ndp); 13162306a36Sopenharmony_ci 13262306a36Sopenharmony_ciint tfrc_rx_hist_duplicate(struct tfrc_rx_hist *h, struct sk_buff *skb); 13362306a36Sopenharmony_ci 13462306a36Sopenharmony_cistruct tfrc_loss_hist; 13562306a36Sopenharmony_ciint tfrc_rx_handle_loss(struct tfrc_rx_hist *h, struct tfrc_loss_hist *lh, 13662306a36Sopenharmony_ci struct sk_buff *skb, const u64 ndp, 13762306a36Sopenharmony_ci u32 (*first_li)(struct sock *sk), struct sock *sk); 13862306a36Sopenharmony_ciu32 tfrc_rx_hist_sample_rtt(struct tfrc_rx_hist *h, const struct sk_buff *skb); 13962306a36Sopenharmony_ciint tfrc_rx_hist_alloc(struct tfrc_rx_hist *h); 14062306a36Sopenharmony_civoid tfrc_rx_hist_purge(struct tfrc_rx_hist *h); 14162306a36Sopenharmony_ci 14262306a36Sopenharmony_ci#endif /* _DCCP_PKT_HIST_ */ 143