linux.git/net/dccp/ccids/lib, branch v2.6.22

[CCID3]: Fix use of invalid loss intervals

2007-04-26T05:26:50+00:00

This fixes a bug which uses an invalid comparison.
The bug resulted in the use of invalid loss intervals.

Signed-off-by: Ian McDonald 
Acked-by: Gerrit Renker 
Signed-off-by: Arnaldo Carvalho de Melo 
Signed-off-by: David S. Miller

[NET] DCCP: Fix whitespace errors.

2007-02-11T07:19:27+00:00

Signed-off-by: YOSHIFUJI Hideaki 
Signed-off-by: David S. Miller

[DCCP] ccid3: Reorder packet history source file

2006-12-11T22:34:57+00:00

No code change at all.

This reorders the source file to follow the same order as the corresponding
header file.

Signed-off-by: Gerrit Renker 
Acked-by: Ian McDonald 
Signed-off-by: Arnaldo Carvalho de Melo

[DCCP] ccid3: Reorder packet history header file

2006-12-11T22:34:56+00:00

No code change at all.

To make the header file easier to read, the following ordering is established
among the declarations:
	* hist_new
	* hist_delete
	* hist_entry_new
	* hist_head
	* hist_find_entry
	* hist_add_entry
	* hist_entry_delete
	* hist_purge

Signed-off-by: Gerrit Renker 
Acked-by: Ian McDonald 
Signed-off-by: Arnaldo Carvalho de Melo

[DCCP] ccid3: TX history - remove unused field

2006-12-11T22:34:53+00:00

This removes the `dccphtx_ccval' field since it is nowhere used in the code and
in fact not necessary for the accounting.

Signed-off-by: Gerrit Renker 
Signed-off-by: Ian McDonald 
Signed-off-by: Arnaldo Carvalho de Melo

[DCCP]: Simplify TFRC calculation

2006-12-11T22:34:46+00:00

In migrating towards using the newer functions scaled_div/scaled_div32
for TFRC computations mapped from floating-point onto integer arithmetic,
this completes the last stage of modifications.

In particular, the overflow case for computing X_calc is circumvented by
 * breaking the computation into two stages
 * the first stage, res = (s*1E6)/R, cannot overflow due to use of u64
 * in the second stage, res = (res*1E6)/f, overflow on u32 is avoided due
   to (i) returning UINT_MAX in this case (which is logically appropriate)
   and (ii) issuing a warning message into the system log (since very likely
   there is a problem somewhere else with the parameters)

Lastly, all such scaling operations are now exported into tfrc.h, since
actually this form of scaled computation is specific to TFRC and not to CCID3.

Signed-off-by: Gerrit Renker 
Acked-by: Ian McDonald 
Signed-off-by: Arnaldo Carvalho de Melo

[PATCH] slab: remove kmem_cache_t

2006-12-07T16:39:25+00:00

Replace all uses of kmem_cache_t with struct kmem_cache.

The patch was generated using the following script:

	#!/bin/sh
	#
	# Replace one string by another in all the kernel sources.
	#

	set -e

	for file in `find * -name "*.c" -o -name "*.h"|xargs grep -l $1`; do
		quilt add $file
		sed -e "1,\$s/$1/$2/g" $file >/tmp/$$
		mv /tmp/$$ $file
		quilt refresh
	done

The script was run like this

	sh replace kmem_cache_t "struct kmem_cache"

Signed-off-by: Christoph Lameter 
Signed-off-by: Andrew Morton 
Signed-off-by: Linus Torvalds

[PATCH] slab: remove SLAB_ATOMIC

2006-12-07T16:39:24+00:00

SLAB_ATOMIC is an alias of GFP_ATOMIC

Signed-off-by: Christoph Lameter 
Signed-off-by: Andrew Morton 
Signed-off-by: Linus Torvalds

[DCCP] tfrc: Binary search for reverse TFRC lookup

2006-12-03T16:53:27+00:00

This replaces the linear search algorithm for reverse lookup with
binary search.

It has the advantage of better scalability: O(log2(N)) instead of O(N).
This means that the average number of iterations is reduced from 250
(linear search if each value appears equally likely) down to at most 9.

Signed-off-by: Gerrit Renker 
Acked-by: Ian McDonald 
Signed-off-by: Arnaldo Carvalho de Melo

[DCCP] tfrc: Identify TFRC table limits and simplify code

2006-12-03T16:52:41+00:00

This
 * adds documentation about the lowest resolution that is possible within
   the bounds of the current lookup table
 * defines a constant TFRC_SMALLEST_P which defines this resolution
 * issues a warning if a given value of p is below resolution
 * combines two previously adjacent if-blocks of nearly identical
   structure into one

This patch does not change the algorithm as such.

Signed-off-by: Gerrit Renker 
Acked-by: Ian McDonald 
Signed-off-by: Arnaldo Carvalho de Melo