eeva/jamulus
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

fixes in comments

Browse source
This commit is contained in:
Volker Fischer 2010-01-03 16:01:43 +00:00
parent af7c8a92f3
commit 40485b8703
1 changed files with 5 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
src/buffer.cpp
View file

@ -4,8 +4,8 @@
* Author(s):
* Volker Fischer
*
* Note: we assuming here that put and get operations are secured by a mutex
* and do not take place at the same time
* Note: We are assuming here that put and get operations are secured by a mutex
* and accessing does not occur at the same time.
*
******************************************************************************
*
@ -242,6 +242,7 @@ void CNetBuf::Clear ( const EClearType eClearType )
{
// Define the number of blocks bound for the "random offset" (1) algorithm.
// If we are above the bound, we use the "middle of buffer" (2) algorithm.
//
// Test results (with different jitter buffer sizes), given is the error
// probability of jitter buffer (probability of corrections in the buffer):
// kX, 128 samples, WLAN:
@ -277,7 +278,7 @@ void CNetBuf::Clear ( const EClearType eClearType )
const int iNumBlocks = iMemSize / iBlockSize;
if ( iNumBlocks <= iNumBlocksBoundInclForRandom ) // just for small buffers
{
// random position algorithm
// Random position algorithm.
// overwrite fill level with random value, the range
// is 0 to (iMemSize - iBlockSize)
iNewFillLevel = static_cast<int> ( static_cast<double> ( rand() ) *
@ -285,7 +286,7 @@ void CNetBuf::Clear ( const EClearType eClearType )
}
else
{
// middle of buffer algorithm
// Middle of buffer algorithm.
// with the following operation we set the fill level to a block
// boundary (one block below the middle of the buffer in case of odd
// number of blocks, e.g.: