2005-08-10 22:59:38 +07:00
|
|
|
/*
|
2006-08-27 09:01:03 +07:00
|
|
|
* net/dccp/packet_history.c
|
2005-08-10 22:59:38 +07:00
|
|
|
*
|
2007-11-28 20:15:40 +07:00
|
|
|
* Copyright (c) 2007 The University of Aberdeen, Scotland, UK
|
|
|
|
* Copyright (c) 2005-7 The University of Waikato, Hamilton, New Zealand.
|
2005-08-10 22:59:38 +07:00
|
|
|
*
|
|
|
|
* An implementation of the DCCP protocol
|
|
|
|
*
|
|
|
|
* This code has been developed by the University of Waikato WAND
|
|
|
|
* research group. For further information please see http://www.wand.net.nz/
|
2006-08-27 09:01:30 +07:00
|
|
|
* or e-mail Ian McDonald - ian.mcdonald@jandi.co.nz
|
2005-08-10 22:59:38 +07:00
|
|
|
*
|
|
|
|
* This code also uses code from Lulea University, rereleased as GPL by its
|
|
|
|
* authors:
|
|
|
|
* Copyright (c) 2003 Nils-Erik Mattsson, Joacim Haggmark, Magnus Erixzon
|
|
|
|
*
|
|
|
|
* Changes to meet Linux coding standards, to make it meet latest ccid3 draft
|
|
|
|
* and to make it work as a loadable module in the DCCP stack written by
|
|
|
|
* Arnaldo Carvalho de Melo <acme@conectiva.com.br>.
|
|
|
|
*
|
|
|
|
* Copyright (c) 2005 Arnaldo Carvalho de Melo <acme@conectiva.com.br>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include "packet_history.h"
|
|
|
|
|
2007-11-30 07:47:15 +07:00
|
|
|
/**
|
|
|
|
* tfrc_tx_hist_entry - Simple singly-linked TX history list
|
|
|
|
* @next: next oldest entry (LIFO order)
|
|
|
|
* @seqno: sequence number of this entry
|
|
|
|
* @stamp: send time of packet with sequence number @seqno
|
|
|
|
*/
|
|
|
|
struct tfrc_tx_hist_entry {
|
|
|
|
struct tfrc_tx_hist_entry *next;
|
|
|
|
u64 seqno;
|
|
|
|
ktime_t stamp;
|
|
|
|
};
|
|
|
|
|
2006-12-10 09:24:33 +07:00
|
|
|
/*
|
2007-11-28 20:15:40 +07:00
|
|
|
* Transmitter History Routines
|
2006-12-10 09:24:33 +07:00
|
|
|
*/
|
2007-12-06 21:27:49 +07:00
|
|
|
static struct kmem_cache *tfrc_tx_hist_slab;
|
2006-12-10 09:24:33 +07:00
|
|
|
|
2007-11-30 07:47:15 +07:00
|
|
|
static struct tfrc_tx_hist_entry *
|
2007-11-28 20:15:40 +07:00
|
|
|
tfrc_tx_hist_find_entry(struct tfrc_tx_hist_entry *head, u64 seqno)
|
2006-12-10 09:24:33 +07:00
|
|
|
{
|
2007-11-28 20:15:40 +07:00
|
|
|
while (head != NULL && head->seqno != seqno)
|
|
|
|
head = head->next;
|
2006-12-10 09:24:33 +07:00
|
|
|
|
2007-11-28 20:15:40 +07:00
|
|
|
return head;
|
2006-12-10 09:24:33 +07:00
|
|
|
}
|
|
|
|
|
2007-11-28 20:15:40 +07:00
|
|
|
int tfrc_tx_hist_add(struct tfrc_tx_hist_entry **headp, u64 seqno)
|
2006-12-10 09:24:33 +07:00
|
|
|
{
|
2007-12-06 21:27:49 +07:00
|
|
|
struct tfrc_tx_hist_entry *entry = kmem_cache_alloc(tfrc_tx_hist_slab, gfp_any());
|
2007-11-28 20:15:40 +07:00
|
|
|
|
|
|
|
if (entry == NULL)
|
|
|
|
return -ENOBUFS;
|
|
|
|
entry->seqno = seqno;
|
|
|
|
entry->stamp = ktime_get_real();
|
|
|
|
entry->next = *headp;
|
|
|
|
*headp = entry;
|
|
|
|
return 0;
|
2006-12-10 09:24:33 +07:00
|
|
|
}
|
2007-11-28 20:15:40 +07:00
|
|
|
EXPORT_SYMBOL_GPL(tfrc_tx_hist_add);
|
2006-12-10 09:24:33 +07:00
|
|
|
|
2007-11-28 20:15:40 +07:00
|
|
|
void tfrc_tx_hist_purge(struct tfrc_tx_hist_entry **headp)
|
2006-12-10 09:24:33 +07:00
|
|
|
{
|
2007-11-28 20:15:40 +07:00
|
|
|
struct tfrc_tx_hist_entry *head = *headp;
|
2006-12-10 09:24:33 +07:00
|
|
|
|
2007-11-28 20:15:40 +07:00
|
|
|
while (head != NULL) {
|
|
|
|
struct tfrc_tx_hist_entry *next = head->next;
|
2006-12-10 09:24:33 +07:00
|
|
|
|
2007-12-06 21:27:49 +07:00
|
|
|
kmem_cache_free(tfrc_tx_hist_slab, head);
|
2007-11-28 20:15:40 +07:00
|
|
|
head = next;
|
2006-12-10 09:24:33 +07:00
|
|
|
}
|
|
|
|
|
2007-11-28 20:15:40 +07:00
|
|
|
*headp = NULL;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(tfrc_tx_hist_purge);
|
2006-12-10 09:24:33 +07:00
|
|
|
|
2007-11-30 07:47:15 +07:00
|
|
|
u32 tfrc_tx_hist_rtt(struct tfrc_tx_hist_entry *head, const u64 seqno,
|
|
|
|
const ktime_t now)
|
|
|
|
{
|
|
|
|
u32 rtt = 0;
|
|
|
|
struct tfrc_tx_hist_entry *packet = tfrc_tx_hist_find_entry(head, seqno);
|
|
|
|
|
|
|
|
if (packet != NULL) {
|
|
|
|
rtt = ktime_us_delta(now, packet->stamp);
|
|
|
|
/*
|
|
|
|
* Garbage-collect older (irrelevant) entries:
|
|
|
|
*/
|
|
|
|
tfrc_tx_hist_purge(&packet->next);
|
|
|
|
}
|
|
|
|
|
|
|
|
return rtt;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(tfrc_tx_hist_rtt);
|
|
|
|
|
2006-12-10 09:24:33 +07:00
|
|
|
/*
|
|
|
|
* Receiver History Routines
|
|
|
|
*/
|
2005-08-10 22:59:38 +07:00
|
|
|
struct dccp_rx_hist *dccp_rx_hist_new(const char *name)
|
|
|
|
{
|
|
|
|
struct dccp_rx_hist *hist = kmalloc(sizeof(*hist), GFP_ATOMIC);
|
|
|
|
static const char dccp_rx_hist_mask[] = "rx_hist_%s";
|
|
|
|
char *slab_name;
|
|
|
|
|
|
|
|
if (hist == NULL)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
slab_name = kmalloc(strlen(name) + sizeof(dccp_rx_hist_mask) - 1,
|
|
|
|
GFP_ATOMIC);
|
|
|
|
if (slab_name == NULL)
|
|
|
|
goto out_free_hist;
|
|
|
|
|
|
|
|
sprintf(slab_name, dccp_rx_hist_mask, name);
|
|
|
|
hist->dccprxh_slab = kmem_cache_create(slab_name,
|
2005-08-14 06:34:54 +07:00
|
|
|
sizeof(struct dccp_rx_hist_entry),
|
2007-11-28 20:15:40 +07:00
|
|
|
0, SLAB_HWCACHE_ALIGN, NULL);
|
2005-08-10 22:59:38 +07:00
|
|
|
if (hist->dccprxh_slab == NULL)
|
|
|
|
goto out_free_slab_name;
|
|
|
|
out:
|
|
|
|
return hist;
|
|
|
|
out_free_slab_name:
|
|
|
|
kfree(slab_name);
|
|
|
|
out_free_hist:
|
|
|
|
kfree(hist);
|
|
|
|
hist = NULL;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL_GPL(dccp_rx_hist_new);
|
|
|
|
|
|
|
|
void dccp_rx_hist_delete(struct dccp_rx_hist *hist)
|
|
|
|
{
|
|
|
|
const char* name = kmem_cache_name(hist->dccprxh_slab);
|
|
|
|
|
|
|
|
kmem_cache_destroy(hist->dccprxh_slab);
|
|
|
|
kfree(name);
|
|
|
|
kfree(hist);
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL_GPL(dccp_rx_hist_delete);
|
|
|
|
|
2006-12-10 09:24:33 +07:00
|
|
|
int dccp_rx_hist_find_entry(const struct list_head *list, const u64 seq,
|
|
|
|
u8 *ccval)
|
2005-08-10 22:59:38 +07:00
|
|
|
{
|
2006-12-10 09:24:33 +07:00
|
|
|
struct dccp_rx_hist_entry *packet = NULL, *entry;
|
2005-08-10 22:59:38 +07:00
|
|
|
|
2006-12-10 09:24:33 +07:00
|
|
|
list_for_each_entry(entry, list, dccphrx_node)
|
|
|
|
if (entry->dccphrx_seqno == seq) {
|
|
|
|
packet = entry;
|
|
|
|
break;
|
|
|
|
}
|
2005-08-10 22:59:38 +07:00
|
|
|
|
2006-12-10 09:24:33 +07:00
|
|
|
if (packet)
|
|
|
|
*ccval = packet->dccphrx_ccval;
|
2005-08-10 22:59:38 +07:00
|
|
|
|
2006-12-10 09:24:33 +07:00
|
|
|
return packet != NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL_GPL(dccp_rx_hist_find_entry);
|
2005-08-10 22:59:38 +07:00
|
|
|
struct dccp_rx_hist_entry *
|
|
|
|
dccp_rx_hist_find_data_packet(const struct list_head *list)
|
|
|
|
{
|
|
|
|
struct dccp_rx_hist_entry *entry, *packet = NULL;
|
|
|
|
|
|
|
|
list_for_each_entry(entry, list, dccphrx_node)
|
|
|
|
if (entry->dccphrx_type == DCCP_PKT_DATA ||
|
|
|
|
entry->dccphrx_type == DCCP_PKT_DATAACK) {
|
|
|
|
packet = entry;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return packet;
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL_GPL(dccp_rx_hist_find_data_packet);
|
|
|
|
|
2006-08-27 13:40:50 +07:00
|
|
|
void dccp_rx_hist_add_packet(struct dccp_rx_hist *hist,
|
2005-08-28 11:19:14 +07:00
|
|
|
struct list_head *rx_list,
|
|
|
|
struct list_head *li_list,
|
2006-08-27 13:40:50 +07:00
|
|
|
struct dccp_rx_hist_entry *packet,
|
|
|
|
u64 nonloss_seqno)
|
2005-08-28 11:19:14 +07:00
|
|
|
{
|
2006-08-27 13:40:50 +07:00
|
|
|
struct dccp_rx_hist_entry *entry, *next;
|
2005-08-28 11:19:14 +07:00
|
|
|
u8 num_later = 0;
|
|
|
|
|
2006-08-27 13:40:50 +07:00
|
|
|
list_add(&packet->dccphrx_node, rx_list);
|
2005-08-28 11:19:14 +07:00
|
|
|
|
|
|
|
num_later = TFRC_RECV_NUM_LATE_LOSS + 1;
|
|
|
|
|
|
|
|
if (!list_empty(li_list)) {
|
|
|
|
list_for_each_entry_safe(entry, next, rx_list, dccphrx_node) {
|
|
|
|
if (num_later == 0) {
|
2006-08-27 13:40:50 +07:00
|
|
|
if (after48(nonloss_seqno,
|
|
|
|
entry->dccphrx_seqno)) {
|
|
|
|
list_del_init(&entry->dccphrx_node);
|
|
|
|
dccp_rx_hist_entry_delete(hist, entry);
|
|
|
|
}
|
2005-08-28 11:19:14 +07:00
|
|
|
} else if (dccp_rx_hist_entry_data_packet(entry))
|
|
|
|
--num_later;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
int step = 0;
|
|
|
|
u8 win_count = 0; /* Not needed, but lets shut up gcc */
|
|
|
|
int tmp;
|
|
|
|
/*
|
|
|
|
* We have no loss interval history so we need at least one
|
|
|
|
* rtt:s of data packets to approximate rtt.
|
|
|
|
*/
|
|
|
|
list_for_each_entry_safe(entry, next, rx_list, dccphrx_node) {
|
|
|
|
if (num_later == 0) {
|
|
|
|
switch (step) {
|
|
|
|
case 0:
|
|
|
|
step = 1;
|
|
|
|
/* OK, find next data packet */
|
|
|
|
num_later = 1;
|
|
|
|
break;
|
|
|
|
case 1:
|
|
|
|
step = 2;
|
|
|
|
/* OK, find next data packet */
|
|
|
|
num_later = 1;
|
|
|
|
win_count = entry->dccphrx_ccval;
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
tmp = win_count - entry->dccphrx_ccval;
|
|
|
|
if (tmp < 0)
|
|
|
|
tmp += TFRC_WIN_COUNT_LIMIT;
|
|
|
|
if (tmp > TFRC_WIN_COUNT_PER_RTT + 1) {
|
|
|
|
/*
|
|
|
|
* We have found a packet older
|
|
|
|
* than one rtt remove the rest
|
|
|
|
*/
|
|
|
|
step = 3;
|
|
|
|
} else /* OK, find next data packet */
|
|
|
|
num_later = 1;
|
|
|
|
break;
|
|
|
|
case 3:
|
|
|
|
list_del_init(&entry->dccphrx_node);
|
|
|
|
dccp_rx_hist_entry_delete(hist, entry);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} else if (dccp_rx_hist_entry_data_packet(entry))
|
|
|
|
--num_later;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPORT_SYMBOL_GPL(dccp_rx_hist_add_packet);
|
|
|
|
|
2006-12-10 09:24:33 +07:00
|
|
|
void dccp_rx_hist_purge(struct dccp_rx_hist *hist, struct list_head *list)
|
2005-08-10 22:59:38 +07:00
|
|
|
{
|
2006-12-10 09:24:33 +07:00
|
|
|
struct dccp_rx_hist_entry *entry, *next;
|
2005-08-10 22:59:38 +07:00
|
|
|
|
2006-12-10 09:24:33 +07:00
|
|
|
list_for_each_entry_safe(entry, next, list, dccphrx_node) {
|
|
|
|
list_del_init(&entry->dccphrx_node);
|
|
|
|
kmem_cache_free(hist->dccprxh_slab, entry);
|
2005-08-10 22:59:38 +07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-12-10 09:24:33 +07:00
|
|
|
EXPORT_SYMBOL_GPL(dccp_rx_hist_purge);
|
2005-08-10 22:59:38 +07:00
|
|
|
|
2007-12-06 21:26:38 +07:00
|
|
|
__init int packet_history_init(void)
|
2007-11-28 20:15:40 +07:00
|
|
|
{
|
2007-12-06 21:27:49 +07:00
|
|
|
tfrc_tx_hist_slab = kmem_cache_create("tfrc_tx_hist",
|
|
|
|
sizeof(struct tfrc_tx_hist_entry), 0,
|
|
|
|
SLAB_HWCACHE_ALIGN, NULL);
|
2007-11-28 20:15:40 +07:00
|
|
|
|
2007-12-06 21:27:49 +07:00
|
|
|
return tfrc_tx_hist_slab == NULL ? -ENOBUFS : 0;
|
2007-11-28 20:15:40 +07:00
|
|
|
}
|
|
|
|
|
2007-12-06 21:26:38 +07:00
|
|
|
void packet_history_exit(void)
|
2007-11-28 20:15:40 +07:00
|
|
|
{
|
2007-12-06 21:27:49 +07:00
|
|
|
if (tfrc_tx_hist_slab != NULL) {
|
|
|
|
kmem_cache_destroy(tfrc_tx_hist_slab);
|
|
|
|
tfrc_tx_hist_slab = NULL;
|
2007-11-28 20:15:40 +07:00
|
|
|
}
|
|
|
|
}
|