2 * net/dccp/packet_history.h
4 * Copyright (c) 2005 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 - iam4@cs.waikato.ac.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 #include <linux/config.h>
38 #include <linux/string.h>
40 #include "packet_history.h"
42 struct dccp_rx_hist *dccp_rx_hist_new(const char *name)
44 struct dccp_rx_hist *hist = kmalloc(sizeof(*hist), GFP_ATOMIC);
45 static const char dccp_rx_hist_mask[] = "rx_hist_%s";
51 slab_name = kmalloc(strlen(name) + sizeof(dccp_rx_hist_mask) - 1,
53 if (slab_name == NULL)
56 sprintf(slab_name, dccp_rx_hist_mask, name);
57 hist->dccprxh_slab = kmem_cache_create(slab_name,
58 sizeof(struct dccp_rx_hist_entry),
59 0, SLAB_HWCACHE_ALIGN,
61 if (hist->dccprxh_slab == NULL)
62 goto out_free_slab_name;
73 EXPORT_SYMBOL_GPL(dccp_rx_hist_new);
75 void dccp_rx_hist_delete(struct dccp_rx_hist *hist)
77 const char* name = kmem_cache_name(hist->dccprxh_slab);
79 kmem_cache_destroy(hist->dccprxh_slab);
84 EXPORT_SYMBOL_GPL(dccp_rx_hist_delete);
86 void dccp_rx_hist_purge(struct dccp_rx_hist *hist, struct list_head *list)
88 struct dccp_rx_hist_entry *entry, *next;
90 list_for_each_entry_safe(entry, next, list, dccphrx_node) {
91 list_del_init(&entry->dccphrx_node);
92 kmem_cache_free(hist->dccprxh_slab, entry);
96 EXPORT_SYMBOL_GPL(dccp_rx_hist_purge);
98 struct dccp_rx_hist_entry *
99 dccp_rx_hist_find_data_packet(const struct list_head *list)
101 struct dccp_rx_hist_entry *entry, *packet = NULL;
103 list_for_each_entry(entry, list, dccphrx_node)
104 if (entry->dccphrx_type == DCCP_PKT_DATA ||
105 entry->dccphrx_type == DCCP_PKT_DATAACK) {
113 EXPORT_SYMBOL_GPL(dccp_rx_hist_find_data_packet);
115 struct dccp_tx_hist *dccp_tx_hist_new(const char *name)
117 struct dccp_tx_hist *hist = kmalloc(sizeof(*hist), GFP_ATOMIC);
118 static const char dccp_tx_hist_mask[] = "tx_hist_%s";
124 slab_name = kmalloc(strlen(name) + sizeof(dccp_tx_hist_mask) - 1,
126 if (slab_name == NULL)
129 sprintf(slab_name, dccp_tx_hist_mask, name);
130 hist->dccptxh_slab = kmem_cache_create(slab_name,
131 sizeof(struct dccp_tx_hist_entry),
132 0, SLAB_HWCACHE_ALIGN,
134 if (hist->dccptxh_slab == NULL)
135 goto out_free_slab_name;
146 EXPORT_SYMBOL_GPL(dccp_tx_hist_new);
148 void dccp_tx_hist_delete(struct dccp_tx_hist *hist)
150 const char* name = kmem_cache_name(hist->dccptxh_slab);
152 kmem_cache_destroy(hist->dccptxh_slab);
157 EXPORT_SYMBOL_GPL(dccp_tx_hist_delete);
159 struct dccp_tx_hist_entry *dccp_tx_hist_find_entry(const struct list_head *list,
162 struct dccp_tx_hist_entry *packet = NULL, *entry;
164 list_for_each_entry(entry, list, dccphtx_node)
165 if (entry->dccphtx_seqno == seq) {
173 EXPORT_SYMBOL_GPL(dccp_tx_hist_find_entry);
175 void dccp_tx_hist_purge_older(struct dccp_tx_hist *hist, struct list_head *list,
176 struct dccp_tx_hist_entry *packet)
178 struct dccp_tx_hist_entry *next;
180 list_for_each_entry_safe_continue(packet, next, list, dccphtx_node) {
181 list_del_init(&packet->dccphtx_node);
182 dccp_tx_hist_entry_delete(hist, packet);
186 EXPORT_SYMBOL_GPL(dccp_tx_hist_purge_older);
188 void dccp_tx_hist_purge(struct dccp_tx_hist *hist, struct list_head *list)
190 struct dccp_tx_hist_entry *entry, *next;
192 list_for_each_entry_safe(entry, next, list, dccphtx_node) {
193 list_del_init(&entry->dccphtx_node);
194 dccp_tx_hist_entry_delete(hist, entry);
198 EXPORT_SYMBOL_GPL(dccp_tx_hist_purge);