Converter: Improve extrapolation for resampler, and also pad decimated DSD, even if not resampling it
Christopher Snowhill
parent
2c7d083588
commit
de193b70e2
|
|
@ -34,9 +34,15 @@
|
|||
|
||||
BOOL skipResampler;
|
||||
|
||||
ssize_t latencyStarted;
|
||||
size_t latencyEaten;
|
||||
BOOL latencyPostfill;
|
||||
unsigned int PRIME_LEN_;
|
||||
unsigned int N_samples_to_add_;
|
||||
unsigned int N_samples_to_drop_;
|
||||
|
||||
unsigned int is_preextrapolated_;
|
||||
unsigned int is_postextrapolated_;
|
||||
|
||||
int latencyEaten;
|
||||
int latencyEatenPost;
|
||||
|
||||
double sampleRatio;
|
||||
|
||||
|
|
@ -52,6 +58,7 @@
|
|||
void **dsd2pcm;
|
||||
size_t dsd2pcmCount;
|
||||
int dsd2pcmLatency;
|
||||
int dsdLatencyEaten;
|
||||
|
||||
AudioStreamBasicDescription inputFormat;
|
||||
AudioStreamBasicDescription floatFormat;
|
||||
|
|
|
|||
|
|
@ -17,6 +17,7 @@
|
|||
#import <audio/conversion/s32_to_float.h>
|
||||
|
||||
#import "lpc.h"
|
||||
#import "util.h"
|
||||
|
||||
#import <TargetConditionals.h>
|
||||
|
||||
|
|
@ -67,11 +68,7 @@ void PrintStreamDesc (AudioStreamBasicDescription *inDesc)
|
|||
paused = NO;
|
||||
outputFormatChanged = NO;
|
||||
|
||||
skipResampler = NO;
|
||||
|
||||
latencyStarted = -1;
|
||||
latencyEaten = 0;
|
||||
latencyPostfill = NO;
|
||||
skipResampler = YES;
|
||||
|
||||
refillNode = nil;
|
||||
originalPreviousNode = nil;
|
||||
|
|
@ -504,6 +501,13 @@ static void dsd2pcm_reset(void * _state)
|
|||
state->fpos = FILT_LOOKUP_PARTS;
|
||||
}
|
||||
|
||||
static int dsd2pcm_latency(void * _state)
|
||||
{
|
||||
struct dsd2pcm_state * state = (struct dsd2pcm_state *) _state;
|
||||
if (state) return state->FIFO_LENGTH;
|
||||
else return 0;
|
||||
}
|
||||
|
||||
static void dsd2pcm_process(void * _state, uint8_t * src, size_t sofs, size_t sinc, float * dest, size_t dofs, size_t dinc, size_t len)
|
||||
{
|
||||
struct dsd2pcm_state * state = (struct dsd2pcm_state *) _state;
|
||||
|
|
@ -538,13 +542,6 @@ static void dsd2pcm_process(void * _state, uint8_t * src, size_t sofs, size_t si
|
|||
state->fpos = fpos;
|
||||
}
|
||||
|
||||
static int dsd2pcm_latency(void * _state)
|
||||
{
|
||||
struct dsd2pcm_state * state = (struct dsd2pcm_state *) _state;
|
||||
if (state) return state->FIFO_LENGTH;
|
||||
else return 0;
|
||||
}
|
||||
|
||||
static void convert_dsd_to_f32(float *output, uint8_t *input, size_t count, size_t channels, void ** dsd2pcm)
|
||||
{
|
||||
for (size_t channel = 0; channel < channels; ++channel)
|
||||
|
|
@ -674,45 +671,6 @@ static void convert_be_to_le(uint8_t *buffer, size_t bitsPerSample, size_t bytes
|
|||
}
|
||||
}
|
||||
|
||||
static const int extrapolate_order = 16;
|
||||
|
||||
static void extrapolate(float *buffer, ssize_t channels, ssize_t frameSize, ssize_t size, BOOL backward, void ** extrapolateBuffer, size_t * extrapolateSize)
|
||||
{
|
||||
const ssize_t delta = (backward ? -1 : 1) * channels;
|
||||
|
||||
size_t lpc_size = sizeof(float) * extrapolate_order;
|
||||
size_t my_work_size = sizeof(float) * frameSize;
|
||||
size_t their_work_size = sizeof(float) * (extrapolate_order + size);
|
||||
|
||||
size_t newSize = lpc_size + my_work_size + their_work_size;
|
||||
if (!*extrapolateBuffer || *extrapolateSize < newSize)
|
||||
{
|
||||
*extrapolateBuffer = realloc(*extrapolateBuffer, newSize);
|
||||
*extrapolateSize = newSize;
|
||||
}
|
||||
|
||||
float *lpc = (float*)(*extrapolateBuffer);
|
||||
float *work = (float*)(*extrapolateBuffer + lpc_size);
|
||||
float *their_work = (float*)(*extrapolateBuffer + lpc_size + my_work_size);
|
||||
|
||||
for (size_t ch = 0; ch < channels; ch++)
|
||||
{
|
||||
if (frameSize - size > extrapolate_order * 2)
|
||||
{
|
||||
float *chPcmBuf = buffer + ch + (backward ? frameSize : -1) * channels;
|
||||
for (size_t i = 0; i < frameSize; i++) work[i] = *(chPcmBuf += delta);
|
||||
|
||||
// Limit extrapolation source to two times the order size
|
||||
vorbis_lpc_from_data(work + frameSize - extrapolate_order * 2, lpc, extrapolate_order * 2, extrapolate_order);
|
||||
|
||||
vorbis_lpc_predict(lpc, work + frameSize - size - extrapolate_order, extrapolate_order, work + frameSize - size, size, their_work);
|
||||
|
||||
chPcmBuf = buffer + ch + (backward ? frameSize : -1) * channels;
|
||||
for (size_t i = 0; i < frameSize; i++) *(chPcmBuf += delta) = work[i];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
-(void)process
|
||||
{
|
||||
char writeBuf[CHUNK_SIZE];
|
||||
|
|
@ -753,10 +711,7 @@ static void extrapolate(float *buffer, ssize_t channels, ssize_t frameSize, ssiz
|
|||
UInt32 ioNumberPackets;
|
||||
int amountReadFromFC;
|
||||
int amountRead = 0;
|
||||
int extrapolateStart = 0;
|
||||
int extrapolateEnd = 0;
|
||||
int eatFromEnd = 0;
|
||||
size_t amountToSkip = 0;
|
||||
int amountToSkip;
|
||||
|
||||
if (stopping)
|
||||
return 0;
|
||||
|
|
@ -779,10 +734,10 @@ tryagain:
|
|||
BOOL isFloat = !!(inputFormat.mFormatFlags & kAudioFormatFlagIsFloat);
|
||||
BOOL isUnsigned = !isFloat && !(inputFormat.mFormatFlags & kAudioFormatFlagIsSignedInteger);
|
||||
|
||||
uint8_t fillByte = (dsd2pcm) ? 0x55 : ((isUnsigned) ? 0x80 : 0x00);
|
||||
|
||||
// Approximately the most we want on input
|
||||
ioNumberPackets = (amount - amountRead) / outputFormat.mBytesPerPacket;
|
||||
if (!skipResampler && ioNumberPackets < PRIME_LEN_)
|
||||
ioNumberPackets = PRIME_LEN_;
|
||||
|
||||
// We want to upscale this count if the ratio is below zero
|
||||
if (sampleRatio < 1.0)
|
||||
|
|
@ -790,38 +745,18 @@ tryagain:
|
|||
ioNumberPackets = ((uint32_t)(ioNumberPackets / sampleRatio) + 15) & ~15;
|
||||
}
|
||||
|
||||
amountToSkip = 0;
|
||||
if (dsd2pcm && !is_preextrapolated_) {
|
||||
amountToSkip = dsd2pcmLatency * inputFormat.mBytesPerPacket;
|
||||
ioNumberPackets += dsd2pcmLatency;
|
||||
}
|
||||
|
||||
size_t newSize = ioNumberPackets * floatFormat.mBytesPerPacket;
|
||||
if (!inputBuffer || inputBufferSize < newSize)
|
||||
inputBuffer = realloc( inputBuffer, inputBufferSize = newSize * 3 );
|
||||
|
||||
ssize_t amountToWrite = ioNumberPackets * inputFormat.mBytesPerPacket;
|
||||
amountToSkip = 0;
|
||||
|
||||
if (!skipResampler)
|
||||
{
|
||||
if (latencyStarted < 0)
|
||||
{
|
||||
latencyStarted = resampler->latency(resampler_data);
|
||||
extrapolateStart = (int)latencyStarted;
|
||||
if (dsd2pcm) extrapolateStart += dsd2pcmLatency;
|
||||
}
|
||||
|
||||
if (latencyStarted)
|
||||
{
|
||||
ssize_t latencyToWrite = latencyStarted * inputFormat.mBytesPerPacket;
|
||||
if (latencyToWrite > amountToWrite)
|
||||
latencyToWrite = amountToWrite;
|
||||
|
||||
memset(inputBuffer, fillByte, latencyToWrite);
|
||||
|
||||
amountToSkip = latencyToWrite;
|
||||
amountToWrite -= amountToSkip;
|
||||
|
||||
latencyEaten = (int)ceil(extrapolateStart * sampleRatio);
|
||||
|
||||
latencyStarted -= latencyToWrite / inputFormat.mBytesPerPacket;
|
||||
}
|
||||
}
|
||||
amountToWrite -= amountToSkip;
|
||||
|
||||
ssize_t bytesReadFromInput = 0;
|
||||
|
||||
|
|
@ -842,26 +777,18 @@ tryagain:
|
|||
|
||||
if (stopping || [self shouldContinue] == NO || [self endOfStream] == YES)
|
||||
{
|
||||
if (!skipResampler && !latencyPostfill)
|
||||
if (!skipResampler && !is_postextrapolated_)
|
||||
{
|
||||
ioNumberPackets = (int)resampler->latency(resampler_data);
|
||||
if (dsd2pcm) ioNumberPackets += dsd2pcmLatency;
|
||||
newSize = ioNumberPackets * inputFormat.mBytesPerPacket;
|
||||
newSize += bytesReadFromInput;
|
||||
if (!inputBuffer || inputBufferSize < newSize)
|
||||
inputBuffer = realloc( inputBuffer, inputBufferSize = newSize * 3);
|
||||
|
||||
latencyPostfill = YES;
|
||||
extrapolateEnd = ioNumberPackets;
|
||||
|
||||
memset(inputBuffer + bytesReadFromInput, fillByte, extrapolateEnd * inputFormat.mBytesPerPacket);
|
||||
|
||||
bytesReadFromInput = newSize;
|
||||
|
||||
if (dsd2pcm)
|
||||
{
|
||||
eatFromEnd = (int)ceil(dsd2pcmLatency * sampleRatio);
|
||||
if (dsd2pcm) {
|
||||
amountToSkip = dsd2pcmLatency * inputFormat.mBytesPerPacket;
|
||||
memset(inputBuffer + bytesReadFromInput, 0x55, amountToSkip);
|
||||
bytesReadFromInput += amountToSkip;
|
||||
amountToSkip = 0;
|
||||
}
|
||||
is_postextrapolated_ = 1;
|
||||
}
|
||||
else if (!is_postextrapolated_ && dsd2pcm) {
|
||||
is_postextrapolated_ = 3;
|
||||
}
|
||||
}
|
||||
|
||||
|
|
@ -869,8 +796,13 @@ tryagain:
|
|||
convertEntered = NO;
|
||||
return amountRead;
|
||||
}
|
||||
|
||||
|
||||
bytesReadFromInput += amountToSkip;
|
||||
|
||||
if (dsd2pcm && amountToSkip) {
|
||||
memset(inputBuffer, 0x55, amountToSkip);
|
||||
dsdLatencyEaten = (int)ceil(dsd2pcmLatency * sampleRatio);
|
||||
}
|
||||
|
||||
if (bytesReadFromInput &&
|
||||
(inputFormat.mFormatFlags & kAudioFormatFlagIsBigEndian))
|
||||
|
|
@ -946,16 +878,63 @@ tryagain:
|
|||
}
|
||||
|
||||
// Extrapolate start
|
||||
if (extrapolateStart)
|
||||
if (!skipResampler && !is_preextrapolated_)
|
||||
{
|
||||
extrapolate( inputBuffer, floatFormat.mChannelsPerFrame, bytesReadFromInput / floatFormat.mBytesPerPacket, extrapolateStart, YES, &extrapolateBuffer, &extrapolateBufferSize);
|
||||
extrapolateStart = 0;
|
||||
size_t samples_in_buffer = bytesReadFromInput / floatFormat.mBytesPerPacket;
|
||||
size_t prime = min(samples_in_buffer, PRIME_LEN_);
|
||||
size_t newSize = N_samples_to_add_ * floatFormat.mBytesPerPacket;
|
||||
newSize += bytesReadFromInput;
|
||||
|
||||
if (newSize > inputBufferSize) {
|
||||
inputBuffer = realloc(inputBuffer, inputBufferSize = newSize * 3);
|
||||
}
|
||||
|
||||
memmove(inputBuffer + N_samples_to_add_ * floatFormat.mBytesPerPacket, inputBuffer, bytesReadFromInput);
|
||||
|
||||
// Great padding! And we want to eat more, based on the resampler filter size
|
||||
int samplesLatency = (int)ceil(resampler->latency(resampler_data) * sampleRatio);
|
||||
|
||||
// Guess what? This extrapolates into the memory before its input pointer!
|
||||
lpc_extrapolate_bkwd(inputBuffer + N_samples_to_add_ * floatFormat.mBytesPerPacket, samples_in_buffer, prime, floatFormat.mChannelsPerFrame, LPC_ORDER, N_samples_to_add_, &extrapolateBuffer, &extrapolateBufferSize);
|
||||
bytesReadFromInput += N_samples_to_add_ * floatFormat.mBytesPerPacket;
|
||||
latencyEaten = N_samples_to_drop_ + samplesLatency;
|
||||
if (dsd2pcm) latencyEaten += dsdLatencyEaten;
|
||||
is_preextrapolated_ = 2;
|
||||
}
|
||||
else if (dsd2pcm && !is_preextrapolated_) {
|
||||
latencyEaten = dsd2pcmLatency;
|
||||
is_preextrapolated_ = 3;
|
||||
}
|
||||
|
||||
if (extrapolateEnd)
|
||||
if (is_postextrapolated_ == 1)
|
||||
{
|
||||
extrapolate( inputBuffer, floatFormat.mChannelsPerFrame, bytesReadFromInput / floatFormat.mBytesPerPacket, extrapolateEnd, NO, &extrapolateBuffer, &extrapolateBufferSize);
|
||||
extrapolateEnd = 0;
|
||||
size_t samples_in_buffer = bytesReadFromInput / floatFormat.mBytesPerPacket;
|
||||
size_t prime = min(samples_in_buffer, PRIME_LEN_);
|
||||
|
||||
size_t newSize = bytesReadFromInput;
|
||||
newSize += N_samples_to_add_ * floatFormat.mBytesPerPacket;
|
||||
if (newSize > inputBufferSize) {
|
||||
inputBuffer = realloc(inputBuffer, inputBufferSize = newSize * 3);
|
||||
}
|
||||
|
||||
// And now that we've reached the end, we eat slightly less, due to the filter size
|
||||
int samplesLatency = (int)resampler->latency(resampler_data);
|
||||
if (dsd2pcm) samplesLatency += dsd2pcmLatency;
|
||||
samplesLatency = (int)ceil(samplesLatency * sampleRatio);
|
||||
|
||||
lpc_extrapolate_fwd(inputBuffer, samples_in_buffer, prime, floatFormat.mChannelsPerFrame, LPC_ORDER, N_samples_to_add_, &extrapolateBuffer, &extrapolateBufferSize);
|
||||
bytesReadFromInput += N_samples_to_add_ * floatFormat.mBytesPerPacket;
|
||||
latencyEatenPost = N_samples_to_drop_;
|
||||
if (latencyEatenPost > samplesLatency) {
|
||||
latencyEatenPost -= samplesLatency;
|
||||
}
|
||||
else {
|
||||
latencyEatenPost = 0;
|
||||
}
|
||||
is_postextrapolated_ = 2;
|
||||
}
|
||||
else if (is_postextrapolated_ == 3) { // skip end of DSD output
|
||||
latencyEatenPost = dsd2pcmLatency;
|
||||
}
|
||||
|
||||
// Input now contains bytesReadFromInput worth of floats, in the input sample rate
|
||||
|
|
@ -1006,35 +985,32 @@ tryagain:
|
|||
|
||||
inpOffset += inputSamples * floatFormat.mBytesPerPacket;
|
||||
|
||||
if (!skipResampler)
|
||||
if (latencyEaten)
|
||||
{
|
||||
if (latencyEaten)
|
||||
if (src_data.output_frames > latencyEaten)
|
||||
{
|
||||
if (src_data.output_frames > latencyEaten)
|
||||
{
|
||||
src_data.output_frames -= latencyEaten;
|
||||
memmove(src_data.data_out, src_data.data_out + latencyEaten * inputFormat.mChannelsPerFrame, src_data.output_frames * floatFormat.mBytesPerPacket);
|
||||
latencyEaten = 0;
|
||||
}
|
||||
else
|
||||
{
|
||||
latencyEaten -= src_data.output_frames;
|
||||
src_data.output_frames = 0;
|
||||
}
|
||||
src_data.output_frames -= latencyEaten;
|
||||
memmove(src_data.data_out, src_data.data_out + latencyEaten * inputFormat.mChannelsPerFrame, src_data.output_frames * floatFormat.mBytesPerPacket);
|
||||
latencyEaten = 0;
|
||||
}
|
||||
else if (eatFromEnd)
|
||||
else
|
||||
{
|
||||
if (src_data.output_frames > eatFromEnd)
|
||||
{
|
||||
src_data.output_frames -= eatFromEnd;
|
||||
}
|
||||
else
|
||||
{
|
||||
src_data.output_frames = 0;
|
||||
}
|
||||
eatFromEnd = 0;
|
||||
latencyEaten -= src_data.output_frames;
|
||||
src_data.output_frames = 0;
|
||||
}
|
||||
}
|
||||
else if (latencyEatenPost)
|
||||
{
|
||||
if (src_data.output_frames > latencyEatenPost)
|
||||
{
|
||||
src_data.output_frames -= latencyEatenPost;
|
||||
}
|
||||
else
|
||||
{
|
||||
src_data.output_frames = 0;
|
||||
}
|
||||
latencyEatenPost = 0;
|
||||
}
|
||||
|
||||
amountReadFromFC = (int)(src_data.output_frames * floatFormat.mBytesPerPacket);
|
||||
|
||||
|
|
@ -1224,12 +1200,23 @@ static float db_to_scale(float db)
|
|||
{
|
||||
return NO;
|
||||
}
|
||||
|
||||
latencyStarted = -1;
|
||||
latencyEaten = 0;
|
||||
latencyPostfill = NO;
|
||||
|
||||
PRIME_LEN_ = max(floatFormat.mSampleRate/20, 1024u);
|
||||
PRIME_LEN_ = min(PRIME_LEN_, 16384u);
|
||||
PRIME_LEN_ = max(PRIME_LEN_, 2*LPC_ORDER + 1);
|
||||
|
||||
N_samples_to_add_ = floatFormat.mSampleRate;
|
||||
N_samples_to_drop_ = outputFormat.mSampleRate;
|
||||
|
||||
samples_len(&N_samples_to_add_, &N_samples_to_drop_, 20, 8192u);
|
||||
|
||||
is_preextrapolated_ = 0;
|
||||
is_postextrapolated_ = 0;
|
||||
}
|
||||
|
||||
latencyEaten = 0;
|
||||
latencyEatenPost = 0;
|
||||
|
||||
PrintStreamDesc(&inf);
|
||||
PrintStreamDesc(&outf);
|
||||
|
||||
|
|
|
|||
|
|
@ -46,6 +46,11 @@
|
|||
832BEF04278DD06D005E1BC4 /* AVFoundation.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 832BEF03278DD06D005E1BC4 /* AVFoundation.framework */; };
|
||||
8347C7412796C58800FA8A7D /* NSFileHandle+CreateFile.h in Headers */ = {isa = PBXBuildFile; fileRef = 8347C73F2796C58800FA8A7D /* NSFileHandle+CreateFile.h */; };
|
||||
8347C7422796C58800FA8A7D /* NSFileHandle+CreateFile.m in Sources */ = {isa = PBXBuildFile; fileRef = 8347C7402796C58800FA8A7D /* NSFileHandle+CreateFile.m */; };
|
||||
835C88A82797D4D400E28EAE /* LICENSE.LGPL in Resources */ = {isa = PBXBuildFile; fileRef = 835C88A42797D4D400E28EAE /* LICENSE.LGPL */; };
|
||||
835C88A92797D4D400E28EAE /* License.txt in Resources */ = {isa = PBXBuildFile; fileRef = 835C88A52797D4D400E28EAE /* License.txt */; };
|
||||
835C88AA2797D4D400E28EAE /* lpc.c in Sources */ = {isa = PBXBuildFile; fileRef = 835C88A62797D4D400E28EAE /* lpc.c */; };
|
||||
835C88AB2797D4D400E28EAE /* lpc.h in Headers */ = {isa = PBXBuildFile; fileRef = 835C88A72797D4D400E28EAE /* lpc.h */; };
|
||||
835C88AD2797DA5800E28EAE /* util.h in Headers */ = {isa = PBXBuildFile; fileRef = 835C88AC2797DA5800E28EAE /* util.h */; };
|
||||
8384912718080FF100E7332D /* Logging.h in Headers */ = {isa = PBXBuildFile; fileRef = 8384912618080FF100E7332D /* Logging.h */; };
|
||||
8389F270278E64590074164C /* config.h in Headers */ = {isa = PBXBuildFile; fileRef = 8389F225278E64590074164C /* config.h */; };
|
||||
8389F279278E64590074164C /* utf.h in Headers */ = {isa = PBXBuildFile; fileRef = 8389F236278E64590074164C /* utf.h */; };
|
||||
|
|
@ -85,8 +90,6 @@
|
|||
8389F29C278E64590074164C /* audio_resampler.c in Sources */ = {isa = PBXBuildFile; fileRef = 8389F26A278E64590074164C /* audio_resampler.c */; };
|
||||
8389F29D278E64590074164C /* s16_to_float.c in Sources */ = {isa = PBXBuildFile; fileRef = 8389F26C278E64590074164C /* s16_to_float.c */; };
|
||||
8389F29E278E64590074164C /* s32_to_float.c in Sources */ = {isa = PBXBuildFile; fileRef = 8389F26D278E64590074164C /* s32_to_float.c */; };
|
||||
8389F2A3278E646E0074164C /* lpc.h in Headers */ = {isa = PBXBuildFile; fileRef = 8389F2A1278E646E0074164C /* lpc.h */; };
|
||||
8389F2A4278E646E0074164C /* lpc.c in Sources */ = {isa = PBXBuildFile; fileRef = 8389F2A2278E646E0074164C /* lpc.c */; };
|
||||
839366671815923C006DD712 /* CogPluginMulti.h in Headers */ = {isa = PBXBuildFile; fileRef = 839366651815923C006DD712 /* CogPluginMulti.h */; };
|
||||
839366681815923C006DD712 /* CogPluginMulti.m in Sources */ = {isa = PBXBuildFile; fileRef = 839366661815923C006DD712 /* CogPluginMulti.m */; };
|
||||
83A44A01279119B50049B6E2 /* RefillNode.m in Sources */ = {isa = PBXBuildFile; fileRef = 83A449FF279119B50049B6E2 /* RefillNode.m */; };
|
||||
|
|
@ -156,6 +159,11 @@
|
|||
832BEF03278DD06D005E1BC4 /* AVFoundation.framework */ = {isa = PBXFileReference; lastKnownFileType = wrapper.framework; name = AVFoundation.framework; path = System/Library/Frameworks/AVFoundation.framework; sourceTree = SDKROOT; };
|
||||
8347C73F2796C58800FA8A7D /* NSFileHandle+CreateFile.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = "NSFileHandle+CreateFile.h"; path = "../../Utils/NSFileHandle+CreateFile.h"; sourceTree = "<group>"; };
|
||||
8347C7402796C58800FA8A7D /* NSFileHandle+CreateFile.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = "NSFileHandle+CreateFile.m"; path = "../../Utils/NSFileHandle+CreateFile.m"; sourceTree = "<group>"; };
|
||||
835C88A42797D4D400E28EAE /* LICENSE.LGPL */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; path = LICENSE.LGPL; sourceTree = "<group>"; };
|
||||
835C88A52797D4D400E28EAE /* License.txt */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; path = License.txt; sourceTree = "<group>"; };
|
||||
835C88A62797D4D400E28EAE /* lpc.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = lpc.c; sourceTree = "<group>"; };
|
||||
835C88A72797D4D400E28EAE /* lpc.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = lpc.h; sourceTree = "<group>"; };
|
||||
835C88AC2797DA5800E28EAE /* util.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = util.h; path = ThirdParty/lvqcl/util.h; sourceTree = SOURCE_ROOT; };
|
||||
8384912618080FF100E7332D /* Logging.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = Logging.h; path = ../../Utils/Logging.h; sourceTree = "<group>"; };
|
||||
8389F225278E64590074164C /* config.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = config.h; sourceTree = "<group>"; };
|
||||
8389F228278E64590074164C /* encoding_utf.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = encoding_utf.c; sourceTree = "<group>"; };
|
||||
|
|
@ -205,8 +213,6 @@
|
|||
8389F26C278E64590074164C /* s16_to_float.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = s16_to_float.c; sourceTree = "<group>"; };
|
||||
8389F26D278E64590074164C /* s32_to_float.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = s32_to_float.c; sourceTree = "<group>"; };
|
||||
8389F26F278E64590074164C /* stdstring.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = stdstring.c; sourceTree = "<group>"; };
|
||||
8389F2A1278E646E0074164C /* lpc.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = lpc.h; sourceTree = "<group>"; };
|
||||
8389F2A2278E646E0074164C /* lpc.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = lpc.c; sourceTree = "<group>"; };
|
||||
839366651815923C006DD712 /* CogPluginMulti.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = CogPluginMulti.h; sourceTree = "<group>"; };
|
||||
839366661815923C006DD712 /* CogPluginMulti.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; path = CogPluginMulti.m; sourceTree = "<group>"; };
|
||||
83A449FF279119B50049B6E2 /* RefillNode.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; path = RefillNode.m; sourceTree = "<group>"; };
|
||||
|
|
@ -250,7 +256,6 @@
|
|||
0867D691FE84028FC02AAC07 /* CogAudio */ = {
|
||||
isa = PBXGroup;
|
||||
children = (
|
||||
832BEE8E278D40CD005E1BC4 /* ThirdParty */,
|
||||
08FB77AEFE84172EC02AAC07 /* Classes */,
|
||||
32C88DFF0371C24200C91783 /* Other Sources */,
|
||||
089C1665FE841158C02AAC07 /* Resources */,
|
||||
|
|
@ -364,6 +369,8 @@
|
|||
17D21CD80B8BE5B400D1EBDE /* ThirdParty */ = {
|
||||
isa = PBXGroup;
|
||||
children = (
|
||||
835C88A22797D4D400E28EAE /* lvqcl */,
|
||||
8389F224278E64590074164C /* RetroArch */,
|
||||
17D21DC40B8BE79700D1EBDE /* CoreAudioUtils */,
|
||||
17D21CD90B8BE5B400D1EBDE /* VirtualRingBuffer */,
|
||||
);
|
||||
|
|
@ -408,15 +415,6 @@
|
|||
name = "Other Sources";
|
||||
sourceTree = "<group>";
|
||||
};
|
||||
832BEE8E278D40CD005E1BC4 /* ThirdParty */ = {
|
||||
isa = PBXGroup;
|
||||
children = (
|
||||
8389F2A0278E646E0074164C /* Vorbis */,
|
||||
8389F224278E64590074164C /* RetroArch */,
|
||||
);
|
||||
name = ThirdParty;
|
||||
sourceTree = "<group>";
|
||||
};
|
||||
832BEF02278DD06D005E1BC4 /* Frameworks */ = {
|
||||
isa = PBXGroup;
|
||||
children = (
|
||||
|
|
@ -425,14 +423,33 @@
|
|||
name = Frameworks;
|
||||
sourceTree = "<group>";
|
||||
};
|
||||
835C88A22797D4D400E28EAE /* lvqcl */ = {
|
||||
isa = PBXGroup;
|
||||
children = (
|
||||
835C88A32797D4D400E28EAE /* License */,
|
||||
835C88A62797D4D400E28EAE /* lpc.c */,
|
||||
835C88A72797D4D400E28EAE /* lpc.h */,
|
||||
835C88AC2797DA5800E28EAE /* util.h */,
|
||||
);
|
||||
path = lvqcl;
|
||||
sourceTree = "<group>";
|
||||
};
|
||||
835C88A32797D4D400E28EAE /* License */ = {
|
||||
isa = PBXGroup;
|
||||
children = (
|
||||
835C88A42797D4D400E28EAE /* LICENSE.LGPL */,
|
||||
835C88A52797D4D400E28EAE /* License.txt */,
|
||||
);
|
||||
path = License;
|
||||
sourceTree = "<group>";
|
||||
};
|
||||
8389F224278E64590074164C /* RetroArch */ = {
|
||||
isa = PBXGroup;
|
||||
children = (
|
||||
8389F225278E64590074164C /* config.h */,
|
||||
8389F226278E64590074164C /* libretro-common */,
|
||||
);
|
||||
name = RetroArch;
|
||||
path = ../ThirdParty/RetroArch;
|
||||
path = RetroArch;
|
||||
sourceTree = "<group>";
|
||||
};
|
||||
8389F226278E64590074164C /* libretro-common */ = {
|
||||
|
|
@ -697,16 +714,6 @@
|
|||
path = string;
|
||||
sourceTree = "<group>";
|
||||
};
|
||||
8389F2A0278E646E0074164C /* Vorbis */ = {
|
||||
isa = PBXGroup;
|
||||
children = (
|
||||
8389F2A1278E646E0074164C /* lpc.h */,
|
||||
8389F2A2278E646E0074164C /* lpc.c */,
|
||||
);
|
||||
name = Vorbis;
|
||||
path = ../ThirdParty/Vorbis;
|
||||
sourceTree = "<group>";
|
||||
};
|
||||
/* End PBXGroup section */
|
||||
|
||||
/* Begin PBXHeadersBuildPhase section */
|
||||
|
|
@ -735,6 +742,7 @@
|
|||
8389F28D278E64590074164C /* features_cpu.h in Headers */,
|
||||
17D21CDF0B8BE5B400D1EBDE /* VirtualRingBuffer.h in Headers */,
|
||||
8389F282278E64590074164C /* retro_common_api.h in Headers */,
|
||||
835C88AB2797D4D400E28EAE /* lpc.h in Headers */,
|
||||
8389F28F278E64590074164C /* rtime.h in Headers */,
|
||||
17D21CF30B8BE5EF00D1EBDE /* Semaphore.h in Headers */,
|
||||
8389F285278E64590074164C /* config_file.h in Headers */,
|
||||
|
|
@ -747,7 +755,6 @@
|
|||
17A2D3C50B8D1D37000778C4 /* AudioDecoder.h in Headers */,
|
||||
8389F27D278E64590074164C /* strl.h in Headers */,
|
||||
8389F281278E64590074164C /* msvc.h in Headers */,
|
||||
8389F2A3278E646E0074164C /* lpc.h in Headers */,
|
||||
8347C7412796C58800FA8A7D /* NSFileHandle+CreateFile.h in Headers */,
|
||||
8389F290278E64590074164C /* boolean.h in Headers */,
|
||||
8389F295278E64590074164C /* retro_assert.h in Headers */,
|
||||
|
|
@ -770,6 +777,7 @@
|
|||
8389F289278E64590074164C /* rhmap.h in Headers */,
|
||||
8389F28B278E64590074164C /* retro_math.h in Headers */,
|
||||
B0575F2D0D687A0800411D77 /* Helper.h in Headers */,
|
||||
835C88AD2797DA5800E28EAE /* util.h in Headers */,
|
||||
07DB5F3E0ED353A900C2E3EF /* AudioMetadataWriter.h in Headers */,
|
||||
);
|
||||
runOnlyForDeploymentPostprocessing = 0;
|
||||
|
|
@ -834,6 +842,8 @@
|
|||
isa = PBXResourcesBuildPhase;
|
||||
buildActionMask = 2147483647;
|
||||
files = (
|
||||
835C88A92797D4D400E28EAE /* License.txt in Resources */,
|
||||
835C88A82797D4D400E28EAE /* LICENSE.LGPL in Resources */,
|
||||
);
|
||||
runOnlyForDeploymentPostprocessing = 0;
|
||||
};
|
||||
|
|
@ -859,6 +869,7 @@
|
|||
8347C7422796C58800FA8A7D /* NSFileHandle+CreateFile.m in Sources */,
|
||||
17D21DC80B8BE79700D1EBDE /* CoreAudioUtils.m in Sources */,
|
||||
839366681815923C006DD712 /* CogPluginMulti.m in Sources */,
|
||||
835C88AA2797D4D400E28EAE /* lpc.c in Sources */,
|
||||
17D21EBE0B8BF44000D1EBDE /* AudioPlayer.m in Sources */,
|
||||
17F94DD60B8D0F7000A34E87 /* PluginController.m in Sources */,
|
||||
17A2D3C60B8D1D37000778C4 /* AudioDecoder.m in Sources */,
|
||||
|
|
@ -869,7 +880,6 @@
|
|||
8EC122600B993BD500C5B3AD /* ConverterNode.m in Sources */,
|
||||
8E8D3D300CBAEE6E00135C1B /* AudioContainer.m in Sources */,
|
||||
B0575F300D687A4000411D77 /* Helper.m in Sources */,
|
||||
8389F2A4278E646E0074164C /* lpc.c in Sources */,
|
||||
8389F29C278E64590074164C /* audio_resampler.c in Sources */,
|
||||
07DB5F3F0ED353A900C2E3EF /* AudioMetadataWriter.m in Sources */,
|
||||
);
|
||||
|
|
@ -896,6 +906,10 @@
|
|||
GCC_OPTIMIZATION_LEVEL = 0;
|
||||
GCC_PRECOMPILE_PREFIX_HEADER = YES;
|
||||
GCC_PREFIX_HEADER = CogAudio_Prefix.pch;
|
||||
HEADER_SEARCH_PATHS = (
|
||||
"ThirdParty/RetroArch/libretro-common/include",
|
||||
ThirdParty/RetroArch,
|
||||
);
|
||||
INFOPLIST_FILE = Info.plist;
|
||||
INSTALL_PATH = "@executable_path/../Frameworks";
|
||||
OTHER_LDFLAGS = "";
|
||||
|
|
@ -925,6 +939,10 @@
|
|||
GCC_MODEL_TUNING = G5;
|
||||
GCC_PRECOMPILE_PREFIX_HEADER = YES;
|
||||
GCC_PREFIX_HEADER = CogAudio_Prefix.pch;
|
||||
HEADER_SEARCH_PATHS = (
|
||||
"ThirdParty/RetroArch/libretro-common/include",
|
||||
ThirdParty/RetroArch,
|
||||
);
|
||||
INFOPLIST_FILE = Info.plist;
|
||||
INSTALL_PATH = "@executable_path/../Frameworks";
|
||||
OTHER_LDFLAGS = "";
|
||||
|
|
|
|||
|
|
@ -0,0 +1,504 @@
|
|||
GNU LESSER GENERAL PUBLIC LICENSE
|
||||
Version 2.1, February 1999
|
||||
|
||||
Copyright (C) 1991, 1999 Free Software Foundation, Inc.
|
||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
[This is the first released version of the Lesser GPL. It also counts
|
||||
as the successor of the GNU Library Public License, version 2, hence
|
||||
the version number 2.1.]
|
||||
|
||||
Preamble
|
||||
|
||||
The licenses for most software are designed to take away your
|
||||
freedom to share and change it. By contrast, the GNU General Public
|
||||
Licenses are intended to guarantee your freedom to share and change
|
||||
free software--to make sure the software is free for all its users.
|
||||
|
||||
This license, the Lesser General Public License, applies to some
|
||||
specially designated software packages--typically libraries--of the
|
||||
Free Software Foundation and other authors who decide to use it. You
|
||||
can use it too, but we suggest you first think carefully about whether
|
||||
this license or the ordinary General Public License is the better
|
||||
strategy to use in any particular case, based on the explanations below.
|
||||
|
||||
When we speak of free software, we are referring to freedom of use,
|
||||
not price. Our General Public Licenses are designed to make sure that
|
||||
you have the freedom to distribute copies of free software (and charge
|
||||
for this service if you wish); that you receive source code or can get
|
||||
it if you want it; that you can change the software and use pieces of
|
||||
it in new free programs; and that you are informed that you can do
|
||||
these things.
|
||||
|
||||
To protect your rights, we need to make restrictions that forbid
|
||||
distributors to deny you these rights or to ask you to surrender these
|
||||
rights. These restrictions translate to certain responsibilities for
|
||||
you if you distribute copies of the library or if you modify it.
|
||||
|
||||
For example, if you distribute copies of the library, whether gratis
|
||||
or for a fee, you must give the recipients all the rights that we gave
|
||||
you. You must make sure that they, too, receive or can get the source
|
||||
code. If you link other code with the library, you must provide
|
||||
complete object files to the recipients, so that they can relink them
|
||||
with the library after making changes to the library and recompiling
|
||||
it. And you must show them these terms so they know their rights.
|
||||
|
||||
We protect your rights with a two-step method: (1) we copyright the
|
||||
library, and (2) we offer you this license, which gives you legal
|
||||
permission to copy, distribute and/or modify the library.
|
||||
|
||||
To protect each distributor, we want to make it very clear that
|
||||
there is no warranty for the free library. Also, if the library is
|
||||
modified by someone else and passed on, the recipients should know
|
||||
that what they have is not the original version, so that the original
|
||||
author's reputation will not be affected by problems that might be
|
||||
introduced by others.
|
||||
|
||||
Finally, software patents pose a constant threat to the existence of
|
||||
any free program. We wish to make sure that a company cannot
|
||||
effectively restrict the users of a free program by obtaining a
|
||||
restrictive license from a patent holder. Therefore, we insist that
|
||||
any patent license obtained for a version of the library must be
|
||||
consistent with the full freedom of use specified in this license.
|
||||
|
||||
Most GNU software, including some libraries, is covered by the
|
||||
ordinary GNU General Public License. This license, the GNU Lesser
|
||||
General Public License, applies to certain designated libraries, and
|
||||
is quite different from the ordinary General Public License. We use
|
||||
this license for certain libraries in order to permit linking those
|
||||
libraries into non-free programs.
|
||||
|
||||
When a program is linked with a library, whether statically or using
|
||||
a shared library, the combination of the two is legally speaking a
|
||||
combined work, a derivative of the original library. The ordinary
|
||||
General Public License therefore permits such linking only if the
|
||||
entire combination fits its criteria of freedom. The Lesser General
|
||||
Public License permits more lax criteria for linking other code with
|
||||
the library.
|
||||
|
||||
We call this license the "Lesser" General Public License because it
|
||||
does Less to protect the user's freedom than the ordinary General
|
||||
Public License. It also provides other free software developers Less
|
||||
of an advantage over competing non-free programs. These disadvantages
|
||||
are the reason we use the ordinary General Public License for many
|
||||
libraries. However, the Lesser license provides advantages in certain
|
||||
special circumstances.
|
||||
|
||||
For example, on rare occasions, there may be a special need to
|
||||
encourage the widest possible use of a certain library, so that it becomes
|
||||
a de-facto standard. To achieve this, non-free programs must be
|
||||
allowed to use the library. A more frequent case is that a free
|
||||
library does the same job as widely used non-free libraries. In this
|
||||
case, there is little to gain by limiting the free library to free
|
||||
software only, so we use the Lesser General Public License.
|
||||
|
||||
In other cases, permission to use a particular library in non-free
|
||||
programs enables a greater number of people to use a large body of
|
||||
free software. For example, permission to use the GNU C Library in
|
||||
non-free programs enables many more people to use the whole GNU
|
||||
operating system, as well as its variant, the GNU/Linux operating
|
||||
system.
|
||||
|
||||
Although the Lesser General Public License is Less protective of the
|
||||
users' freedom, it does ensure that the user of a program that is
|
||||
linked with the Library has the freedom and the wherewithal to run
|
||||
that program using a modified version of the Library.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow. Pay close attention to the difference between a
|
||||
"work based on the library" and a "work that uses the library". The
|
||||
former contains code derived from the library, whereas the latter must
|
||||
be combined with the library in order to run.
|
||||
|
||||
GNU LESSER GENERAL PUBLIC LICENSE
|
||||
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
||||
|
||||
0. This License Agreement applies to any software library or other
|
||||
program which contains a notice placed by the copyright holder or
|
||||
other authorized party saying it may be distributed under the terms of
|
||||
this Lesser General Public License (also called "this License").
|
||||
Each licensee is addressed as "you".
|
||||
|
||||
A "library" means a collection of software functions and/or data
|
||||
prepared so as to be conveniently linked with application programs
|
||||
(which use some of those functions and data) to form executables.
|
||||
|
||||
The "Library", below, refers to any such software library or work
|
||||
which has been distributed under these terms. A "work based on the
|
||||
Library" means either the Library or any derivative work under
|
||||
copyright law: that is to say, a work containing the Library or a
|
||||
portion of it, either verbatim or with modifications and/or translated
|
||||
straightforwardly into another language. (Hereinafter, translation is
|
||||
included without limitation in the term "modification".)
|
||||
|
||||
"Source code" for a work means the preferred form of the work for
|
||||
making modifications to it. For a library, complete source code means
|
||||
all the source code for all modules it contains, plus any associated
|
||||
interface definition files, plus the scripts used to control compilation
|
||||
and installation of the library.
|
||||
|
||||
Activities other than copying, distribution and modification are not
|
||||
covered by this License; they are outside its scope. The act of
|
||||
running a program using the Library is not restricted, and output from
|
||||
such a program is covered only if its contents constitute a work based
|
||||
on the Library (independent of the use of the Library in a tool for
|
||||
writing it). Whether that is true depends on what the Library does
|
||||
and what the program that uses the Library does.
|
||||
|
||||
1. You may copy and distribute verbatim copies of the Library's
|
||||
complete source code as you receive it, in any medium, provided that
|
||||
you conspicuously and appropriately publish on each copy an
|
||||
appropriate copyright notice and disclaimer of warranty; keep intact
|
||||
all the notices that refer to this License and to the absence of any
|
||||
warranty; and distribute a copy of this License along with the
|
||||
Library.
|
||||
|
||||
You may charge a fee for the physical act of transferring a copy,
|
||||
and you may at your option offer warranty protection in exchange for a
|
||||
fee.
|
||||
|
||||
2. You may modify your copy or copies of the Library or any portion
|
||||
of it, thus forming a work based on the Library, and copy and
|
||||
distribute such modifications or work under the terms of Section 1
|
||||
above, provided that you also meet all of these conditions:
|
||||
|
||||
a) The modified work must itself be a software library.
|
||||
|
||||
b) You must cause the files modified to carry prominent notices
|
||||
stating that you changed the files and the date of any change.
|
||||
|
||||
c) You must cause the whole of the work to be licensed at no
|
||||
charge to all third parties under the terms of this License.
|
||||
|
||||
d) If a facility in the modified Library refers to a function or a
|
||||
table of data to be supplied by an application program that uses
|
||||
the facility, other than as an argument passed when the facility
|
||||
is invoked, then you must make a good faith effort to ensure that,
|
||||
in the event an application does not supply such function or
|
||||
table, the facility still operates, and performs whatever part of
|
||||
its purpose remains meaningful.
|
||||
|
||||
(For example, a function in a library to compute square roots has
|
||||
a purpose that is entirely well-defined independent of the
|
||||
application. Therefore, Subsection 2d requires that any
|
||||
application-supplied function or table used by this function must
|
||||
be optional: if the application does not supply it, the square
|
||||
root function must still compute square roots.)
|
||||
|
||||
These requirements apply to the modified work as a whole. If
|
||||
identifiable sections of that work are not derived from the Library,
|
||||
and can be reasonably considered independent and separate works in
|
||||
themselves, then this License, and its terms, do not apply to those
|
||||
sections when you distribute them as separate works. But when you
|
||||
distribute the same sections as part of a whole which is a work based
|
||||
on the Library, the distribution of the whole must be on the terms of
|
||||
this License, whose permissions for other licensees extend to the
|
||||
entire whole, and thus to each and every part regardless of who wrote
|
||||
it.
|
||||
|
||||
Thus, it is not the intent of this section to claim rights or contest
|
||||
your rights to work written entirely by you; rather, the intent is to
|
||||
exercise the right to control the distribution of derivative or
|
||||
collective works based on the Library.
|
||||
|
||||
In addition, mere aggregation of another work not based on the Library
|
||||
with the Library (or with a work based on the Library) on a volume of
|
||||
a storage or distribution medium does not bring the other work under
|
||||
the scope of this License.
|
||||
|
||||
3. You may opt to apply the terms of the ordinary GNU General Public
|
||||
License instead of this License to a given copy of the Library. To do
|
||||
this, you must alter all the notices that refer to this License, so
|
||||
that they refer to the ordinary GNU General Public License, version 2,
|
||||
instead of to this License. (If a newer version than version 2 of the
|
||||
ordinary GNU General Public License has appeared, then you can specify
|
||||
that version instead if you wish.) Do not make any other change in
|
||||
these notices.
|
||||
|
||||
Once this change is made in a given copy, it is irreversible for
|
||||
that copy, so the ordinary GNU General Public License applies to all
|
||||
subsequent copies and derivative works made from that copy.
|
||||
|
||||
This option is useful when you wish to copy part of the code of
|
||||
the Library into a program that is not a library.
|
||||
|
||||
4. You may copy and distribute the Library (or a portion or
|
||||
derivative of it, under Section 2) in object code or executable form
|
||||
under the terms of Sections 1 and 2 above provided that you accompany
|
||||
it with the complete corresponding machine-readable source code, which
|
||||
must be distributed under the terms of Sections 1 and 2 above on a
|
||||
medium customarily used for software interchange.
|
||||
|
||||
If distribution of object code is made by offering access to copy
|
||||
from a designated place, then offering equivalent access to copy the
|
||||
source code from the same place satisfies the requirement to
|
||||
distribute the source code, even though third parties are not
|
||||
compelled to copy the source along with the object code.
|
||||
|
||||
5. A program that contains no derivative of any portion of the
|
||||
Library, but is designed to work with the Library by being compiled or
|
||||
linked with it, is called a "work that uses the Library". Such a
|
||||
work, in isolation, is not a derivative work of the Library, and
|
||||
therefore falls outside the scope of this License.
|
||||
|
||||
However, linking a "work that uses the Library" with the Library
|
||||
creates an executable that is a derivative of the Library (because it
|
||||
contains portions of the Library), rather than a "work that uses the
|
||||
library". The executable is therefore covered by this License.
|
||||
Section 6 states terms for distribution of such executables.
|
||||
|
||||
When a "work that uses the Library" uses material from a header file
|
||||
that is part of the Library, the object code for the work may be a
|
||||
derivative work of the Library even though the source code is not.
|
||||
Whether this is true is especially significant if the work can be
|
||||
linked without the Library, or if the work is itself a library. The
|
||||
threshold for this to be true is not precisely defined by law.
|
||||
|
||||
If such an object file uses only numerical parameters, data
|
||||
structure layouts and accessors, and small macros and small inline
|
||||
functions (ten lines or less in length), then the use of the object
|
||||
file is unrestricted, regardless of whether it is legally a derivative
|
||||
work. (Executables containing this object code plus portions of the
|
||||
Library will still fall under Section 6.)
|
||||
|
||||
Otherwise, if the work is a derivative of the Library, you may
|
||||
distribute the object code for the work under the terms of Section 6.
|
||||
Any executables containing that work also fall under Section 6,
|
||||
whether or not they are linked directly with the Library itself.
|
||||
|
||||
6. As an exception to the Sections above, you may also combine or
|
||||
link a "work that uses the Library" with the Library to produce a
|
||||
work containing portions of the Library, and distribute that work
|
||||
under terms of your choice, provided that the terms permit
|
||||
modification of the work for the customer's own use and reverse
|
||||
engineering for debugging such modifications.
|
||||
|
||||
You must give prominent notice with each copy of the work that the
|
||||
Library is used in it and that the Library and its use are covered by
|
||||
this License. You must supply a copy of this License. If the work
|
||||
during execution displays copyright notices, you must include the
|
||||
copyright notice for the Library among them, as well as a reference
|
||||
directing the user to the copy of this License. Also, you must do one
|
||||
of these things:
|
||||
|
||||
a) Accompany the work with the complete corresponding
|
||||
machine-readable source code for the Library including whatever
|
||||
changes were used in the work (which must be distributed under
|
||||
Sections 1 and 2 above); and, if the work is an executable linked
|
||||
with the Library, with the complete machine-readable "work that
|
||||
uses the Library", as object code and/or source code, so that the
|
||||
user can modify the Library and then relink to produce a modified
|
||||
executable containing the modified Library. (It is understood
|
||||
that the user who changes the contents of definitions files in the
|
||||
Library will not necessarily be able to recompile the application
|
||||
to use the modified definitions.)
|
||||
|
||||
b) Use a suitable shared library mechanism for linking with the
|
||||
Library. A suitable mechanism is one that (1) uses at run time a
|
||||
copy of the library already present on the user's computer system,
|
||||
rather than copying library functions into the executable, and (2)
|
||||
will operate properly with a modified version of the library, if
|
||||
the user installs one, as long as the modified version is
|
||||
interface-compatible with the version that the work was made with.
|
||||
|
||||
c) Accompany the work with a written offer, valid for at
|
||||
least three years, to give the same user the materials
|
||||
specified in Subsection 6a, above, for a charge no more
|
||||
than the cost of performing this distribution.
|
||||
|
||||
d) If distribution of the work is made by offering access to copy
|
||||
from a designated place, offer equivalent access to copy the above
|
||||
specified materials from the same place.
|
||||
|
||||
e) Verify that the user has already received a copy of these
|
||||
materials or that you have already sent this user a copy.
|
||||
|
||||
For an executable, the required form of the "work that uses the
|
||||
Library" must include any data and utility programs needed for
|
||||
reproducing the executable from it. However, as a special exception,
|
||||
the materials to be distributed need not include anything that is
|
||||
normally distributed (in either source or binary form) with the major
|
||||
components (compiler, kernel, and so on) of the operating system on
|
||||
which the executable runs, unless that component itself accompanies
|
||||
the executable.
|
||||
|
||||
It may happen that this requirement contradicts the license
|
||||
restrictions of other proprietary libraries that do not normally
|
||||
accompany the operating system. Such a contradiction means you cannot
|
||||
use both them and the Library together in an executable that you
|
||||
distribute.
|
||||
|
||||
7. You may place library facilities that are a work based on the
|
||||
Library side-by-side in a single library together with other library
|
||||
facilities not covered by this License, and distribute such a combined
|
||||
library, provided that the separate distribution of the work based on
|
||||
the Library and of the other library facilities is otherwise
|
||||
permitted, and provided that you do these two things:
|
||||
|
||||
a) Accompany the combined library with a copy of the same work
|
||||
based on the Library, uncombined with any other library
|
||||
facilities. This must be distributed under the terms of the
|
||||
Sections above.
|
||||
|
||||
b) Give prominent notice with the combined library of the fact
|
||||
that part of it is a work based on the Library, and explaining
|
||||
where to find the accompanying uncombined form of the same work.
|
||||
|
||||
8. You may not copy, modify, sublicense, link with, or distribute
|
||||
the Library except as expressly provided under this License. Any
|
||||
attempt otherwise to copy, modify, sublicense, link with, or
|
||||
distribute the Library is void, and will automatically terminate your
|
||||
rights under this License. However, parties who have received copies,
|
||||
or rights, from you under this License will not have their licenses
|
||||
terminated so long as such parties remain in full compliance.
|
||||
|
||||
9. You are not required to accept this License, since you have not
|
||||
signed it. However, nothing else grants you permission to modify or
|
||||
distribute the Library or its derivative works. These actions are
|
||||
prohibited by law if you do not accept this License. Therefore, by
|
||||
modifying or distributing the Library (or any work based on the
|
||||
Library), you indicate your acceptance of this License to do so, and
|
||||
all its terms and conditions for copying, distributing or modifying
|
||||
the Library or works based on it.
|
||||
|
||||
10. Each time you redistribute the Library (or any work based on the
|
||||
Library), the recipient automatically receives a license from the
|
||||
original licensor to copy, distribute, link with or modify the Library
|
||||
subject to these terms and conditions. You may not impose any further
|
||||
restrictions on the recipients' exercise of the rights granted herein.
|
||||
You are not responsible for enforcing compliance by third parties with
|
||||
this License.
|
||||
|
||||
11. If, as a consequence of a court judgment or allegation of patent
|
||||
infringement or for any other reason (not limited to patent issues),
|
||||
conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot
|
||||
distribute so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you
|
||||
may not distribute the Library at all. For example, if a patent
|
||||
license would not permit royalty-free redistribution of the Library by
|
||||
all those who receive copies directly or indirectly through you, then
|
||||
the only way you could satisfy both it and this License would be to
|
||||
refrain entirely from distribution of the Library.
|
||||
|
||||
If any portion of this section is held invalid or unenforceable under any
|
||||
particular circumstance, the balance of the section is intended to apply,
|
||||
and the section as a whole is intended to apply in other circumstances.
|
||||
|
||||
It is not the purpose of this section to induce you to infringe any
|
||||
patents or other property right claims or to contest validity of any
|
||||
such claims; this section has the sole purpose of protecting the
|
||||
integrity of the free software distribution system which is
|
||||
implemented by public license practices. Many people have made
|
||||
generous contributions to the wide range of software distributed
|
||||
through that system in reliance on consistent application of that
|
||||
system; it is up to the author/donor to decide if he or she is willing
|
||||
to distribute software through any other system and a licensee cannot
|
||||
impose that choice.
|
||||
|
||||
This section is intended to make thoroughly clear what is believed to
|
||||
be a consequence of the rest of this License.
|
||||
|
||||
12. If the distribution and/or use of the Library is restricted in
|
||||
certain countries either by patents or by copyrighted interfaces, the
|
||||
original copyright holder who places the Library under this License may add
|
||||
an explicit geographical distribution limitation excluding those countries,
|
||||
so that distribution is permitted only in or among countries not thus
|
||||
excluded. In such case, this License incorporates the limitation as if
|
||||
written in the body of this License.
|
||||
|
||||
13. The Free Software Foundation may publish revised and/or new
|
||||
versions of the Lesser General Public License from time to time.
|
||||
Such new versions will be similar in spirit to the present version,
|
||||
but may differ in detail to address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the Library
|
||||
specifies a version number of this License which applies to it and
|
||||
"any later version", you have the option of following the terms and
|
||||
conditions either of that version or of any later version published by
|
||||
the Free Software Foundation. If the Library does not specify a
|
||||
license version number, you may choose any version ever published by
|
||||
the Free Software Foundation.
|
||||
|
||||
14. If you wish to incorporate parts of the Library into other free
|
||||
programs whose distribution conditions are incompatible with these,
|
||||
write to the author to ask for permission. For software which is
|
||||
copyrighted by the Free Software Foundation, write to the Free
|
||||
Software Foundation; we sometimes make exceptions for this. Our
|
||||
decision will be guided by the two goals of preserving the free status
|
||||
of all derivatives of our free software and of promoting the sharing
|
||||
and reuse of software generally.
|
||||
|
||||
NO WARRANTY
|
||||
|
||||
15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
|
||||
WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
|
||||
EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
|
||||
OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
|
||||
KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
|
||||
LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
|
||||
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
|
||||
WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
|
||||
AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
|
||||
FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
|
||||
CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
|
||||
LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
|
||||
RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
|
||||
FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
|
||||
SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
|
||||
DAMAGES.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Libraries
|
||||
|
||||
If you develop a new library, and you want it to be of the greatest
|
||||
possible use to the public, we recommend making it free software that
|
||||
everyone can redistribute and change. You can do so by permitting
|
||||
redistribution under these terms (or, alternatively, under the terms of the
|
||||
ordinary General Public License).
|
||||
|
||||
To apply these terms, attach the following notices to the library. It is
|
||||
safest to attach them to the start of each source file to most effectively
|
||||
convey the exclusion of warranty; and each file should have at least the
|
||||
"copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the library's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2.1 of the License, or (at your option) any later version.
|
||||
|
||||
This library 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
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
You should also get your employer (if you work as a programmer) or your
|
||||
school, if any, to sign a "copyright disclaimer" for the library, if
|
||||
necessary. Here is a sample; alter the names:
|
||||
|
||||
Yoyodyne, Inc., hereby disclaims all copyright interest in the
|
||||
library `Frob' (a library for tweaking knobs) written by James Random Hacker.
|
||||
|
||||
<signature of Ty Coon>, 1 April 1990
|
||||
Ty Coon, President of Vice
|
||||
|
||||
That's all there is to it!
|
||||
|
||||
|
||||
|
|
@ -0,0 +1,39 @@
|
|||
SoX resampler plugin for foobar2000 audio player
|
||||
Copyright (C) lvqcl
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2.1 of the License, or (at your option) any later version.
|
||||
|
||||
This library 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
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
|
||||
|
||||
This software uses code of SoX licensed under the terms of LGPLv2.1
|
||||
Copyright (C) robs@users.sourceforge.net
|
||||
Copyright (C) Chris Bagwell and SoX contributors
|
||||
Copyright (C) Reuben Thomas
|
||||
|
||||
|
||||
This software uses code of FFmpeg licensed under the terms of LGPLv2.1
|
||||
Copyright (C) Fabrice Bellard
|
||||
Copyright (C) Michael Niedermayer <michaelni@gmx.at>
|
||||
Copyright (C) Alex Converse <alex dot converse at gmail dot com>
|
||||
Copyright (C) Loren Merritt
|
||||
Copyright (C) Vitor Sessak
|
||||
Copyright (C) x264 project
|
||||
|
||||
|
||||
This software uses code of General Purpose FFT Package
|
||||
Copyright (C) Takuya OOURA
|
||||
|
||||
|
||||
This software uses code of foobar2000 1.4 SDK
|
||||
Copyright (C) 2001-2018, Peter Pawlowski
|
||||
|
|
@ -0,0 +1,204 @@
|
|||
/*
|
||||
* Copyright (c) 2013, 2018 lvqcl
|
||||
*
|
||||
* Permission to use, copy, modify, and distribute this software for any
|
||||
* purpose with or without fee is hereby granted, provided that the above
|
||||
* copyright notice and this permission notice appear in all copies.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
||||
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
||||
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
||||
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
||||
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
||||
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
||||
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
||||
*/
|
||||
|
||||
#include <memory.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdbool.h>
|
||||
#include "lpc.h"
|
||||
|
||||
static void apply_window(float * const data, const size_t data_len);
|
||||
static void compute_autocorr(const float * const data, const size_t data_len, double * const autoc, const int m);
|
||||
static int compute_lpc(const double * const autoc, double * const lpc, const int lpc_order);
|
||||
static void lpc_extrapolate_data(float * const data0, const size_t data_len, const size_t extra, const double * const lpc, const int order, const bool invdir);
|
||||
|
||||
void lpc_extrapolate2(float * const data, const size_t data_len, const int nch, const int lpc_order, const size_t extra_bkwd, const size_t extra_fwd, void ** extrapolate_buffer, size_t * extrapolate_buffer_size)
|
||||
{
|
||||
const size_t tdata0_size = sizeof(float) * (extra_bkwd + data_len + extra_fwd);
|
||||
const size_t autoc_size = sizeof(double) * (lpc_order + 1);
|
||||
const size_t lpc_size = sizeof(double) * lpc_order;
|
||||
|
||||
const size_t new_size = tdata0_size + autoc_size + lpc_size;
|
||||
|
||||
if (new_size > *extrapolate_buffer_size)
|
||||
{
|
||||
*extrapolate_buffer = realloc(*extrapolate_buffer, new_size);
|
||||
*extrapolate_buffer_size = new_size;
|
||||
}
|
||||
|
||||
float* tdata0 = (float*)(*extrapolate_buffer); // for 1 channel only
|
||||
float* const tdata = tdata0 + extra_bkwd; // for 1 channel only
|
||||
|
||||
double* autoc = (double*)(*extrapolate_buffer + tdata0_size);
|
||||
double* lpc = (double*)(*extrapolate_buffer + tdata0_size + autoc_size);
|
||||
int max_order;
|
||||
|
||||
for(int c = 0; c < nch; c++)
|
||||
{
|
||||
for (int i = -(int)extra_bkwd; i < (int)(data_len+extra_fwd); i++) { tdata[i] = 0; } // should be removed after debugging etc
|
||||
|
||||
for (int i = 0; i < (int)data_len; i++)
|
||||
tdata[i] = data[i*nch + c];
|
||||
|
||||
apply_window(tdata, data_len);
|
||||
compute_autocorr(tdata, data_len, autoc, lpc_order);
|
||||
max_order = compute_lpc(autoc, lpc, lpc_order);
|
||||
|
||||
// restore after apply_window
|
||||
for (int i = 0; i < (int)data_len; i++)
|
||||
tdata[i] = data[i*nch + c];
|
||||
|
||||
if (extra_fwd)
|
||||
{
|
||||
lpc_extrapolate_data(tdata, data_len, extra_fwd, lpc, max_order, false);
|
||||
for (size_t i = data_len; i < (data_len+extra_fwd); i++)
|
||||
data[i*nch + c] = tdata[i];
|
||||
}
|
||||
if (extra_bkwd)
|
||||
{
|
||||
lpc_extrapolate_data(tdata, data_len, extra_bkwd, lpc, max_order, true);
|
||||
for (int i = -(int)extra_bkwd; i < 0; i++)
|
||||
data[i*nch + c] = tdata[i];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void apply_window(float * const data, const size_t data_len)
|
||||
{
|
||||
#if 0
|
||||
if (0) // subtract the mean
|
||||
{
|
||||
double mean = 0;
|
||||
for(int i = 0; i < (int)data_len; i++)
|
||||
mean += data[i];
|
||||
mean /= data_len;
|
||||
|
||||
for(int i = 0; i < (int)data_len; i++)
|
||||
data[i] -= (float)mean;
|
||||
}
|
||||
#endif
|
||||
|
||||
if (1) // Welch window
|
||||
{
|
||||
const float n2 = (data_len+1)/2.0f;
|
||||
for(int i = 0; i < (int)data_len; i++)
|
||||
{
|
||||
float k = (i+1-n2)/n2;
|
||||
data[i] *= 1.0f - k*k;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void compute_autocorr(const float * const data, const size_t data_len, double * const autoc, const int m)
|
||||
{
|
||||
int i, j;
|
||||
|
||||
j = m + 1;
|
||||
// for(j = 0; j <= m; j++)
|
||||
while(j--)
|
||||
{
|
||||
double d = 0;
|
||||
for(i = j; i < (int)data_len; i++)
|
||||
d += (double)data[i] * data[i-j];
|
||||
|
||||
autoc[j] = d;
|
||||
}
|
||||
}
|
||||
|
||||
static int compute_lpc(const double * const autoc, double * const lpc, const int lpc_order)
|
||||
{
|
||||
int i, j;
|
||||
double error, epsilon;
|
||||
int max_order = lpc_order;
|
||||
|
||||
error = autoc[0] * (1.+1e-10);
|
||||
epsilon = 1e-9*autoc[0] + 1e-10;
|
||||
|
||||
for(i = 0; i < lpc_order; i++)
|
||||
{
|
||||
if (error < epsilon)
|
||||
{
|
||||
memset(&lpc[i], 0, (lpc_order-i)*sizeof(lpc[0]));
|
||||
max_order = i; break;
|
||||
}
|
||||
|
||||
double r = -autoc[i+1];
|
||||
for(j = 0; j < i; j++)
|
||||
r -= lpc[j] * autoc[i-j];
|
||||
r /= error;
|
||||
|
||||
lpc[i] = r;
|
||||
for(j = 0; j < i/2; j++)
|
||||
{
|
||||
double tmp = lpc[j];
|
||||
lpc[j ] += r * lpc[i-1-j];
|
||||
lpc[i-1-j] += r * tmp;
|
||||
}
|
||||
if (i&1)
|
||||
lpc[j] += lpc[j]*r;
|
||||
|
||||
error *= 1.0 - r*r;
|
||||
}
|
||||
|
||||
if (1) /* slightly damp the filter */
|
||||
{
|
||||
const double g = 0.999;
|
||||
double damp = g;
|
||||
for(j = 0; j < max_order; j++)
|
||||
{
|
||||
lpc[j] *= damp;
|
||||
damp *= g;
|
||||
}
|
||||
}
|
||||
|
||||
if (max_order == 0) /* in case the signal is constant AND we subtract the mean in apply_window() */
|
||||
{
|
||||
max_order = 1;
|
||||
lpc[0] = -1;
|
||||
}
|
||||
|
||||
return max_order;
|
||||
}
|
||||
|
||||
static void lpc_extrapolate_data(float * const data0, const size_t data_len, const size_t extra, const double * const lpc, const int order, const bool invdir)
|
||||
{
|
||||
int i, j;
|
||||
if (invdir == false)
|
||||
{
|
||||
float* data = data0 + data_len - order;
|
||||
for(i = 0; i < (int)extra; i++)
|
||||
{
|
||||
float sum = 0;
|
||||
for(j = 0; j < order; j++)
|
||||
sum -= data[i+j] * (float)lpc[order-1-j];
|
||||
|
||||
if (sum > 10.f) sum = 10.f; else if (sum < -10.f) sum = -10.f; // should be removed after debugging etc
|
||||
data[order+i] = sum;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
float* data = data0 - 1 + order;
|
||||
for(i = 0; i < (int)extra; i++)
|
||||
{
|
||||
float sum = 0;
|
||||
for(j = 0; j < order; j++)
|
||||
sum -= data[-i-j] * (float)lpc[order-1-j];
|
||||
|
||||
if (sum > 10.f) sum = 10.f; else if (sum < -10.f) sum = -10.f; // should be removed after debugging etc
|
||||
data[-order-i] = sum;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,40 @@
|
|||
#ifndef MY_LPC_H
|
||||
#define MY_LPC_H
|
||||
|
||||
/* data - beginning of the data
|
||||
* data_len - length of data (in samples) that are base for extrapolation
|
||||
* nch - number of (interleaved) channels
|
||||
* lpc_order - LPC order
|
||||
* extra_bkwd - number of samples to pre-extrapolate
|
||||
* extra_fwd - number of samples to post-extrapolate
|
||||
*
|
||||
* D = data; N = num_channels; LEN = data_len*N; EX = extra*N
|
||||
*
|
||||
* memory layout when invdir == false:
|
||||
*
|
||||
* [||||||||||||||||||||||||||||||||][||||||||||||||||||||][
|
||||
* ^ D[0] ^ D[LEN] ^ D[LEN+EX]
|
||||
*
|
||||
* memory layout when invdir == true:
|
||||
* ][||||||||||||||||||||][||||||||||||||||||||||||||||||||][
|
||||
* ^ D[0] ^ D[LEN]
|
||||
* ^ D[-1*N-EX] ^ D[-1*N]
|
||||
*
|
||||
*/
|
||||
|
||||
static const size_t LPC_ORDER = 32;
|
||||
|
||||
void lpc_extrapolate2(float * const data, const size_t data_len, const int nch, const int lpc_order, const size_t extra_bkwd, const size_t extra_fwd, void ** extrapolate_buffer, size_t * extrapolate_buffer_size);
|
||||
|
||||
static inline void lpc_extrapolate_bkwd(float * const data, const size_t data_len, const size_t prime_len, const int nch, const int lpc_order, const size_t extra_bkwd, void ** extrapolate_buffer, size_t * extrapolate_buffer_size)
|
||||
{
|
||||
(void)data_len;
|
||||
lpc_extrapolate2(data, prime_len, nch, lpc_order, extra_bkwd, 0, extrapolate_buffer, extrapolate_buffer_size);
|
||||
}
|
||||
|
||||
static inline void lpc_extrapolate_fwd(float * const data, const size_t data_len, const size_t prime_len, const int nch, const int lpc_order, const size_t extra_fwd, void ** extrapolate_buffer, size_t * extrapolate_buffer_size)
|
||||
{
|
||||
lpc_extrapolate2(data + (data_len - prime_len)*nch, prime_len, nch, lpc_order, 0, extra_fwd, extrapolate_buffer, extrapolate_buffer_size);
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,55 @@
|
|||
/* Copyright (c) 2018 lvqcl. All rights reserved.
|
||||
*
|
||||
* This library is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU Lesser General Public License as published by
|
||||
* the Free Software Foundation; either version 2.1 of the License, or (at
|
||||
* your option) any later version.
|
||||
*
|
||||
* This library 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 Lesser
|
||||
* General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU Lesser General Public License
|
||||
* along with this library; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
#ifndef UTIL_H_
|
||||
#define UTIL_H_
|
||||
|
||||
#ifndef min
|
||||
#define min(a,b) (((a)<(b))?(a):(b))
|
||||
#endif
|
||||
#ifndef max
|
||||
#define max(a,b) (((a)>(b))?(a):(b))
|
||||
#endif
|
||||
|
||||
static inline unsigned local_gcd(unsigned a, unsigned b)
|
||||
{
|
||||
if (a == 0 || b == 0) return 0;
|
||||
unsigned c = a % b;
|
||||
while (c != 0) { a = b; b = c; c = a % b; }
|
||||
return b;
|
||||
}
|
||||
|
||||
/*
|
||||
In: *r1 and *r2: samplerates;
|
||||
Out: *r1 and *r2: numbers of samples;
|
||||
|
||||
multiply r1 and r2 by n so that durations is 1/N th of second;
|
||||
limit n so that r1 and r2 aren't bigger than M
|
||||
*/
|
||||
static void samples_len(unsigned* r1, unsigned* r2, unsigned N, unsigned M) // example: r1 = 44100, r2 = 48000, N = 20, M = 8192
|
||||
{
|
||||
if (r1 == 0 || r2 == 0) return;
|
||||
unsigned v = local_gcd(*r1, *r2); // v = 300
|
||||
*r1 /= v; *r2 /= v; // r1 = 147; r2 = 160 == 1/300th of second
|
||||
unsigned n = (v + N-1) / N; // n = 300/20 = 15 times
|
||||
unsigned z = max(*r1, *r2); // z = 160
|
||||
if (z*n > M) n = M / z; // 160*15 = 2400 < 8192;; if M == 1024: n = 1024/160 = 6; 160*6 = 960
|
||||
if (n < 1) n = 1;
|
||||
*r1 *= n; *r2 *= n; // r1 = 147*15 = 2205 samples, r2 = 160*15 = 2400 samples
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -1,156 +0,0 @@
|
|||
/********************************************************************
|
||||
* *
|
||||
* THIS FILE IS PART OF THE OggVorbis SOFTWARE CODEC SOURCE CODE. *
|
||||
* USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS *
|
||||
* GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE *
|
||||
* IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. *
|
||||
* *
|
||||
* THE OggVorbis SOURCE CODE IS (C) COPYRIGHT 1994-2009 *
|
||||
* by the Xiph.Org Foundation http://www.xiph.org/ *
|
||||
* *
|
||||
********************************************************************
|
||||
|
||||
function: LPC low level routines
|
||||
last mod: $Id: lpc.c 16227 2009-07-08 06:58:46Z xiphmont $
|
||||
|
||||
********************************************************************/
|
||||
|
||||
/* Some of these routines (autocorrelator, LPC coefficient estimator)
|
||||
are derived from code written by Jutta Degener and Carsten Bormann;
|
||||
thus we include their copyright below. The entirety of this file
|
||||
is freely redistributable on the condition that both of these
|
||||
copyright notices are preserved without modification. */
|
||||
|
||||
/* Preserved Copyright: *********************************************/
|
||||
|
||||
/* Copyright 1992, 1993, 1994 by Jutta Degener and Carsten Bormann,
|
||||
Technische Universita"t Berlin
|
||||
|
||||
Any use of this software is permitted provided that this notice is not
|
||||
removed and that neither the authors nor the Technische Universita"t
|
||||
Berlin are deemed to have made any representations as to the
|
||||
suitability of this software for any purpose nor are held responsible
|
||||
for any defects of this software. THERE IS ABSOLUTELY NO WARRANTY FOR
|
||||
THIS SOFTWARE.
|
||||
|
||||
As a matter of courtesy, the authors request to be informed about uses
|
||||
this software has found, about bugs in this software, and about any
|
||||
improvements that may be of general interest.
|
||||
|
||||
Berlin, 28.11.1994
|
||||
Jutta Degener
|
||||
Carsten Bormann
|
||||
|
||||
*********************************************************************/
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <math.h>
|
||||
#include "lpc.h"
|
||||
|
||||
/* Autocorrelation LPC coeff generation algorithm invented by
|
||||
N. Levinson in 1947, modified by J. Durbin in 1959. */
|
||||
|
||||
/* Input : n elements of time doamin data
|
||||
Output: m lpc coefficients, excitation energy */
|
||||
|
||||
float vorbis_lpc_from_data(float *data,float *lpci,int n,int m){
|
||||
double aut[m+1];
|
||||
double lpc[m];
|
||||
double error;
|
||||
double epsilon;
|
||||
int i,j;
|
||||
|
||||
/* autocorrelation, p+1 lag coefficients */
|
||||
j=m+1;
|
||||
while(j--){
|
||||
double d=0; /* double needed for accumulator depth */
|
||||
for(i=j;i<n;i++)d+=(double)data[i]*data[i-j];
|
||||
aut[j]=d;
|
||||
}
|
||||
|
||||
/* Generate lpc coefficients from autocorr values */
|
||||
|
||||
/* set our noise floor to about -100dB */
|
||||
error=aut[0] * (1. + 1e-10);
|
||||
epsilon=1e-9*aut[0]+1e-10;
|
||||
|
||||
for(i=0;i<m;i++){
|
||||
double r= -aut[i+1];
|
||||
|
||||
if(error<epsilon){
|
||||
memset(lpc+i,0,(m-i)*sizeof(*lpc));
|
||||
goto done;
|
||||
}
|
||||
|
||||
/* Sum up this iteration's reflection coefficient; note that in
|
||||
Vorbis we don't save it. If anyone wants to recycle this code
|
||||
and needs reflection coefficients, save the results of 'r' from
|
||||
each iteration. */
|
||||
|
||||
for(j=0;j<i;j++)r-=lpc[j]*aut[i-j];
|
||||
r/=error;
|
||||
|
||||
/* Update LPC coefficients and total error */
|
||||
|
||||
lpc[i]=r;
|
||||
for(j=0;j<i/2;j++){
|
||||
double tmp=lpc[j];
|
||||
|
||||
lpc[j]+=r*lpc[i-1-j];
|
||||
lpc[i-1-j]+=r*tmp;
|
||||
}
|
||||
if(i&1)lpc[j]+=lpc[j]*r;
|
||||
|
||||
error*=1.-r*r;
|
||||
|
||||
}
|
||||
|
||||
done:
|
||||
|
||||
/* slightly damp the filter */
|
||||
{
|
||||
double g = .99;
|
||||
double damp = g;
|
||||
for(j=0;j<m;j++){
|
||||
lpc[j]*=damp;
|
||||
damp*=g;
|
||||
}
|
||||
}
|
||||
|
||||
for(j=0;j<m;j++)lpci[j]=(float)lpc[j];
|
||||
|
||||
/* we need the error value to know how big an impulse to hit the
|
||||
filter with later */
|
||||
|
||||
return error;
|
||||
}
|
||||
|
||||
void vorbis_lpc_predict(float *coeff,float *prime,int m,
|
||||
float *data,long n, float *work){
|
||||
|
||||
/* in: coeff[0...m-1] LPC coefficients
|
||||
prime[0...m-1] initial values (allocated size of n+m-1)
|
||||
out: data[0...n-1] data samples */
|
||||
|
||||
long i,j,o,p;
|
||||
float y;
|
||||
//float work[m+n];
|
||||
|
||||
if(!prime)
|
||||
for(i=0;i<m;i++)
|
||||
work[i]=0.f;
|
||||
else
|
||||
for(i=0;i<m;i++)
|
||||
work[i]=prime[i];
|
||||
|
||||
for(i=0;i<n;i++){
|
||||
y=0;
|
||||
o=i;
|
||||
p=m;
|
||||
for(j=0;j<m;j++)
|
||||
y-=work[o++]*coeff[--p];
|
||||
|
||||
data[i]=work[o]=y;
|
||||
}
|
||||
}
|
||||
|
|
@ -1,27 +0,0 @@
|
|||
/********************************************************************
|
||||
* *
|
||||
* THIS FILE IS PART OF THE OggVorbis SOFTWARE CODEC SOURCE CODE. *
|
||||
* USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS *
|
||||
* GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE *
|
||||
* IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. *
|
||||
* *
|
||||
* THE OggVorbis SOURCE CODE IS (C) COPYRIGHT 1994-2007 *
|
||||
* by the Xiph.Org Foundation http://www.xiph.org/ *
|
||||
* *
|
||||
********************************************************************
|
||||
|
||||
function: LPC low level routines
|
||||
last mod: $Id: lpc.h 16037 2009-05-26 21:10:58Z xiphmont $
|
||||
|
||||
********************************************************************/
|
||||
|
||||
#ifndef _V_LPC_H_
|
||||
#define _V_LPC_H_
|
||||
|
||||
/* simple linear scale LPC code */
|
||||
extern float vorbis_lpc_from_data(float *data,float *lpc,int n,int m);
|
||||
|
||||
extern void vorbis_lpc_predict(float *coeff,float *prime,int m,
|
||||
float *data,long n,float *work);
|
||||
|
||||
#endif
|
||||
Loading…
Reference in New Issue