2 * net/dccp/packet_history.h
4 * Copyright (c) 2005-6 The University of Waikato, Hamilton, New Zealand.
6 * An implementation of the DCCP protocol
8 * This code has been developed by the University of Waikato WAND
9 * research group. For further information please see http://www.wand.net.nz/
10 * or e-mail Ian McDonald - ian.mcdonald@jandi.co.nz
12 * This code also uses code from Lulea University, rereleased as GPL by its
14 * Copyright (c) 2003 Nils-Erik Mattsson, Joacim Haggmark, Magnus Erixzon
16 * Changes to meet Linux coding standards, to make it meet latest ccid3 draft
17 * and to make it work as a loadable module in the DCCP stack written by
18 * Arnaldo Carvalho de Melo <acme@conectiva.com.br>.
20 * Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@conectiva.com.br>
22 * This program is free software; you can redistribute it and/or modify
23 * it under the terms of the GNU General Public License as published by
24 * the Free Software Foundation; either version 2 of the License, or
25 * (at your option) any later version.
27 * This program is distributed in the hope that it will be useful,
28 * but WITHOUT ANY WARRANTY; without even the implied warranty of
29 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
30 * GNU General Public License for more details.
32 * You should have received a copy of the GNU General Public License
33 * along with this program; if not, write to the Free Software
34 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
37 #ifndef _DCCP_PKT_HIST_
38 #define _DCCP_PKT_HIST_
40 #include <linux/ktime.h>
41 #include <linux/list.h>
42 #include <linux/slab.h>
43 #include <linux/time.h>
45 #include "../../dccp.h"
47 /* Number of later packets received before one is considered lost */
48 #define TFRC_RECV_NUM_LATE_LOSS 3
50 #define TFRC_WIN_COUNT_PER_RTT 4
51 #define TFRC_WIN_COUNT_LIMIT 16
54 * Transmitter History data structures and declarations
56 struct dccp_tx_hist_entry {
57 struct list_head dccphtx_node;
61 struct timeval dccphtx_tstamp;
65 struct kmem_cache *dccptxh_slab;
68 extern struct dccp_tx_hist *dccp_tx_hist_new(const char *name);
69 extern void dccp_tx_hist_delete(struct dccp_tx_hist *hist);
71 static inline struct dccp_tx_hist_entry *
72 dccp_tx_hist_entry_new(struct dccp_tx_hist *hist,
75 struct dccp_tx_hist_entry *entry = kmem_cache_alloc(hist->dccptxh_slab,
79 entry->dccphtx_sent = 0;
84 static inline struct dccp_tx_hist_entry *
85 dccp_tx_hist_head(struct list_head *list)
87 struct dccp_tx_hist_entry *head = NULL;
89 if (!list_empty(list))
90 head = list_entry(list->next, struct dccp_tx_hist_entry,
95 extern struct dccp_tx_hist_entry *
96 dccp_tx_hist_find_entry(const struct list_head *list,
99 static inline void dccp_tx_hist_add_entry(struct list_head *list,
100 struct dccp_tx_hist_entry *entry)
102 list_add(&entry->dccphtx_node, list);
105 static inline void dccp_tx_hist_entry_delete(struct dccp_tx_hist *hist,
106 struct dccp_tx_hist_entry *entry)
109 kmem_cache_free(hist->dccptxh_slab, entry);
112 extern void dccp_tx_hist_purge(struct dccp_tx_hist *hist,
113 struct list_head *list);
115 extern void dccp_tx_hist_purge_older(struct dccp_tx_hist *hist,
116 struct list_head *list,
117 struct dccp_tx_hist_entry *next);
120 * Receiver History data structures and declarations
122 struct dccp_rx_hist_entry {
123 struct list_head dccphrx_node;
124 u64 dccphrx_seqno:48,
127 u32 dccphrx_ndp; /* In fact it is from 8 to 24 bits */
128 ktime_t dccphrx_tstamp;
131 struct dccp_rx_hist {
132 struct kmem_cache *dccprxh_slab;
135 extern struct dccp_rx_hist *dccp_rx_hist_new(const char *name);
136 extern void dccp_rx_hist_delete(struct dccp_rx_hist *hist);
138 static inline struct dccp_rx_hist_entry *
139 dccp_rx_hist_entry_new(struct dccp_rx_hist *hist,
141 const struct sk_buff *skb,
144 struct dccp_rx_hist_entry *entry = kmem_cache_alloc(hist->dccprxh_slab,
148 const struct dccp_hdr *dh = dccp_hdr(skb);
150 entry->dccphrx_seqno = DCCP_SKB_CB(skb)->dccpd_seq;
151 entry->dccphrx_ccval = dh->dccph_ccval;
152 entry->dccphrx_type = dh->dccph_type;
153 entry->dccphrx_ndp = ndp;
154 entry->dccphrx_tstamp = ktime_get_real();
160 static inline struct dccp_rx_hist_entry *
161 dccp_rx_hist_head(struct list_head *list)
163 struct dccp_rx_hist_entry *head = NULL;
165 if (!list_empty(list))
166 head = list_entry(list->next, struct dccp_rx_hist_entry,
171 extern int dccp_rx_hist_find_entry(const struct list_head *list, const u64 seq,
173 extern struct dccp_rx_hist_entry *
174 dccp_rx_hist_find_data_packet(const struct list_head *list);
176 extern void dccp_rx_hist_add_packet(struct dccp_rx_hist *hist,
177 struct list_head *rx_list,
178 struct list_head *li_list,
179 struct dccp_rx_hist_entry *packet,
182 static inline void dccp_rx_hist_entry_delete(struct dccp_rx_hist *hist,
183 struct dccp_rx_hist_entry *entry)
186 kmem_cache_free(hist->dccprxh_slab, entry);
189 extern void dccp_rx_hist_purge(struct dccp_rx_hist *hist,
190 struct list_head *list);
193 dccp_rx_hist_entry_data_packet(const struct dccp_rx_hist_entry *entry)
195 return entry->dccphrx_type == DCCP_PKT_DATA ||
196 entry->dccphrx_type == DCCP_PKT_DATAACK;
199 extern u64 dccp_rx_hist_detect_loss(struct list_head *rx_list,
200 struct list_head *li_list, u8 *win_loss);
202 #endif /* _DCCP_PKT_HIST_ */