mirror of
https://github.com/DSheirer/sdrtrunk.git
synced 2026-11-12 08:37:25 -05:00
f4d8ea281d
Note: Several of the decoders are currently non-functioning in this commit. If you want the latest functioning codebase, please checkout the commit prior to this one. All decoders will eventually be updated with this new architecture. Currently broken: - Logging and recording - Aux decoders (Fleetsync/MDC/LoJack/Tait) - LTR/Passport decoders Changes in this commit: - Module architecture for decoders and components with central provisioning by the DecoderFactory - Transition from Complex sample stream processing to float buffer processing for improved memory management - Redesigned filter structures - to support buffers and streams - Resolved several memory leak issues - Universal sharing of the thread pool manager - Added centralized audio management with call/user prioritization and new gui with mute/volume controls - Embedded audio metadata for eventual streaming support - Redesigned ProcessingChain to support independent re-use - Added new TrafficChannelManager to handle traffic channel allocations - Traffic Channel pool size and Call timeout available in P25 and MPT1327 configs - Redesigned channel and decoder gui components
91 lines
2.2 KiB
Java
91 lines
2.2 KiB
Java
/*******************************************************************************
|
|
* SDR Trunk
|
|
* Copyright (C) 2014 Dennis Sheirer
|
|
*
|
|
* 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 3 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, see <http://www.gnu.org/licenses/>
|
|
******************************************************************************/
|
|
package buffer;
|
|
|
|
import java.util.Arrays;
|
|
|
|
import sample.complex.Complex;
|
|
|
|
/**
|
|
* Circular sample buffer - allocates a buffer and stores samples in a circular
|
|
* fashion, overwriting older samples with newly arrived samples. Initially
|
|
* fills buffer with 0-valued samples
|
|
*
|
|
* Can be used as a delay-type buffer, to delay samples by the 'size' amount
|
|
*/
|
|
public class ComplexCircularBuffer
|
|
{
|
|
Complex[] mBuffer;
|
|
int mBufferPointer = 0;
|
|
|
|
public ComplexCircularBuffer( int size )
|
|
{
|
|
mBuffer = new Complex[ size ];
|
|
|
|
Arrays.fill( mBuffer, new Complex( 1.0f, 1.0f ) );
|
|
}
|
|
|
|
/**
|
|
* Returns the sample currently pointed to in the buffer and stores the
|
|
* new sample in its place
|
|
* @param sample
|
|
* @return
|
|
*/
|
|
public Complex get( Complex sample )
|
|
{
|
|
Complex retVal = mBuffer[ mBufferPointer ];
|
|
|
|
put( sample );
|
|
|
|
return retVal;
|
|
}
|
|
|
|
public void put( Complex sample )
|
|
{
|
|
mBuffer[ mBufferPointer ] = sample;
|
|
|
|
mBufferPointer++;
|
|
|
|
if( mBufferPointer >= mBuffer.length )
|
|
{
|
|
mBufferPointer = 0;
|
|
}
|
|
}
|
|
|
|
public Complex[] get( int count )
|
|
{
|
|
Complex[] samples = new Complex[ count ];
|
|
|
|
int tempCounter = mBufferPointer;
|
|
|
|
for( int x = 0; x < count; x++ )
|
|
{
|
|
samples[ x ] = mBuffer[ tempCounter ];
|
|
|
|
tempCounter++;
|
|
|
|
if( tempCounter > mBuffer.length - 1 )
|
|
{
|
|
tempCounter = 0;
|
|
}
|
|
}
|
|
|
|
return samples;
|
|
}
|
|
}
|