2005-02-06 20:13:21 +00:00
|
|
|
/**
|
|
|
|
* DataFormat.cpp
|
|
|
|
* This file is part of the YATE Project http://YATE.null.ro
|
|
|
|
*
|
|
|
|
* Yet Another Telephony Engine - a fully featured software PBX and IVR
|
2006-05-27 15:08:43 +00:00
|
|
|
* Copyright (C) 2004-2006 Null Team
|
2005-02-06 20:13:21 +00:00
|
|
|
*
|
|
|
|
* 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
|
2006-05-27 15:08:43 +00:00
|
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
|
2005-02-06 20:13:21 +00:00
|
|
|
*/
|
|
|
|
|
2005-03-18 18:16:59 +00:00
|
|
|
#include "yatephone.h"
|
2005-02-06 20:13:21 +00:00
|
|
|
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
|
|
|
namespace TelEngine {
|
|
|
|
|
2006-05-25 20:40:58 +00:00
|
|
|
static const FormatInfo s_formats[] = {
|
|
|
|
FormatInfo("slin", 160, 10000, "audio", 8000, 1, true),
|
|
|
|
FormatInfo("alaw", 80),
|
|
|
|
FormatInfo("mulaw", 80),
|
|
|
|
FormatInfo("slin/16000", 320, 10000, "audio", 16000, 1, true),
|
|
|
|
FormatInfo("alaw/16000", 160, 10000, "audio", 16000),
|
|
|
|
FormatInfo("mulaw/16000", 160, 10000, "audio", 16000),
|
|
|
|
FormatInfo("slin/32000", 640, 10000, "audio", 32000, 1, true),
|
|
|
|
FormatInfo("alaw/32000", 160, 10000, "audio", 32000),
|
|
|
|
FormatInfo("mulaw/32000", 160, 10000, "audio", 32000),
|
|
|
|
FormatInfo("2*slin", 320, 10000, "audio", 8000, 2),
|
|
|
|
FormatInfo("2*slin/16000", 640, 10000, "audio", 16000, 2),
|
|
|
|
FormatInfo("2*slin/32000", 1280, 10000, "audio", 32000, 2),
|
2007-04-06 13:37:56 +00:00
|
|
|
FormatInfo("2*alaw", 160, 10000, "audio", 8000, 2),
|
|
|
|
FormatInfo("2*mulaw", 160, 10000, "audio", 8000, 2),
|
2006-05-25 20:40:58 +00:00
|
|
|
FormatInfo("gsm", 33, 20000),
|
|
|
|
FormatInfo("ilbc20", 38, 20000),
|
|
|
|
FormatInfo("ilbc30", 50, 30000),
|
|
|
|
// FormatInfo("speex", 0),
|
2009-09-23 15:07:50 +00:00
|
|
|
FormatInfo("g729", 10, 10000),
|
2006-05-25 20:40:58 +00:00
|
|
|
FormatInfo("plain", 0, 0, "text", 0),
|
|
|
|
FormatInfo("raw", 0, 0, "data", 0),
|
|
|
|
};
|
|
|
|
|
|
|
|
// FIXME: put proper conversion costs everywhere below
|
|
|
|
|
|
|
|
static TranslatorCaps s_simpleCaps[] = {
|
|
|
|
{ s_formats+0, s_formats+1, 1 },
|
|
|
|
{ s_formats+0, s_formats+2, 1 },
|
|
|
|
{ s_formats+1, s_formats+0, 1 },
|
|
|
|
{ s_formats+1, s_formats+2, 1 },
|
|
|
|
{ s_formats+2, s_formats+0, 1 },
|
|
|
|
{ s_formats+2, s_formats+1, 1 },
|
2007-04-06 13:37:56 +00:00
|
|
|
{ s_formats+9, s_formats+12, 1 },
|
|
|
|
{ s_formats+9, s_formats+13, 1 },
|
|
|
|
{ s_formats+12, s_formats+9, 1 },
|
|
|
|
{ s_formats+13, s_formats+9, 1 },
|
|
|
|
{ s_formats+12, s_formats+13, 1 },
|
|
|
|
{ s_formats+13, s_formats+12, 1 },
|
2006-05-25 20:40:58 +00:00
|
|
|
{ 0, 0, 0 }
|
|
|
|
};
|
|
|
|
|
|
|
|
static TranslatorCaps s_simpleCaps16k[] = {
|
|
|
|
{ s_formats+3, s_formats+4, 1 },
|
|
|
|
{ s_formats+3, s_formats+5, 1 },
|
|
|
|
{ s_formats+4, s_formats+3, 1 },
|
|
|
|
{ s_formats+4, s_formats+5, 1 },
|
|
|
|
{ s_formats+5, s_formats+3, 1 },
|
|
|
|
{ s_formats+5, s_formats+4, 1 },
|
|
|
|
{ 0, 0, 0 }
|
|
|
|
};
|
|
|
|
|
|
|
|
static TranslatorCaps s_simpleCaps32k[] = {
|
|
|
|
{ s_formats+6, s_formats+7, 1 },
|
|
|
|
{ s_formats+6, s_formats+8, 1 },
|
|
|
|
{ s_formats+7, s_formats+6, 1 },
|
|
|
|
{ s_formats+7, s_formats+8, 1 },
|
|
|
|
{ s_formats+8, s_formats+6, 1 },
|
|
|
|
{ s_formats+8, s_formats+7, 1 },
|
|
|
|
{ 0, 0, 0 }
|
|
|
|
};
|
|
|
|
|
|
|
|
static TranslatorCaps s_resampCaps[] = {
|
|
|
|
{ s_formats+0, s_formats+3, 2 },
|
|
|
|
{ s_formats+0, s_formats+6, 2 },
|
|
|
|
{ s_formats+3, s_formats+0, 2 },
|
|
|
|
{ s_formats+3, s_formats+6, 2 },
|
|
|
|
{ s_formats+6, s_formats+0, 2 },
|
|
|
|
{ s_formats+6, s_formats+3, 2 },
|
|
|
|
{ 0, 0, 0 }
|
|
|
|
};
|
|
|
|
|
|
|
|
static TranslatorCaps s_stereoCaps[] = {
|
|
|
|
{ s_formats+0, s_formats+9, 1 },
|
|
|
|
{ s_formats+9, s_formats+0, 2 },
|
|
|
|
{ s_formats+3, s_formats+10, 1 },
|
|
|
|
{ s_formats+10, s_formats+3, 2 },
|
|
|
|
{ s_formats+6, s_formats+11, 1 },
|
|
|
|
{ s_formats+11, s_formats+6, 2 },
|
|
|
|
{ 0, 0, 0 }
|
|
|
|
};
|
|
|
|
|
2009-05-05 12:25:31 +00:00
|
|
|
static Mutex s_dataMutex(true,"DataEndpoint");
|
2010-10-27 16:03:44 +00:00
|
|
|
static Mutex s_consSrcMutex(false,"DataConsumer::Source");
|
2006-01-19 21:13:49 +00:00
|
|
|
|
2005-02-06 20:13:21 +00:00
|
|
|
class ThreadedSourcePrivate : public Thread
|
|
|
|
{
|
2006-01-20 17:54:25 +00:00
|
|
|
friend class ThreadedSource;
|
2005-02-06 20:13:21 +00:00
|
|
|
public:
|
2006-01-20 17:54:25 +00:00
|
|
|
ThreadedSourcePrivate(ThreadedSource* source, const char* name, Thread::Priority prio)
|
2005-04-28 22:46:59 +00:00
|
|
|
: Thread(name,prio), m_source(source) { }
|
2005-02-06 20:13:21 +00:00
|
|
|
|
|
|
|
protected:
|
|
|
|
virtual void run()
|
2006-01-20 17:54:25 +00:00
|
|
|
{
|
|
|
|
m_source->run();
|
2007-06-08 18:33:33 +00:00
|
|
|
// execute cleanup from this thread if possible
|
|
|
|
cleanup();
|
2006-01-20 17:54:25 +00:00
|
|
|
}
|
2005-02-06 20:13:21 +00:00
|
|
|
|
|
|
|
virtual void cleanup()
|
2006-01-20 17:54:25 +00:00
|
|
|
{
|
2009-09-07 23:49:12 +00:00
|
|
|
RefPointer<ThreadedSource> source = m_source;
|
2007-06-08 18:33:33 +00:00
|
|
|
m_source = 0;
|
|
|
|
if (source)
|
|
|
|
source->cleanup();
|
2006-01-20 17:54:25 +00:00
|
|
|
}
|
2005-02-06 20:13:21 +00:00
|
|
|
|
|
|
|
private:
|
2009-09-07 23:49:12 +00:00
|
|
|
RefPointer<ThreadedSource> m_source;
|
2005-02-06 20:13:21 +00:00
|
|
|
};
|
|
|
|
|
2006-05-25 20:40:58 +00:00
|
|
|
// slin/alaw/mulaw converter
|
2005-02-06 20:13:21 +00:00
|
|
|
class SimpleTranslator : public DataTranslator
|
|
|
|
{
|
|
|
|
public:
|
2005-04-11 00:56:55 +00:00
|
|
|
SimpleTranslator(const DataFormat& sFormat, const DataFormat& dFormat)
|
2005-02-06 20:13:21 +00:00
|
|
|
: DataTranslator(sFormat,dFormat) { }
|
2009-07-02 09:24:33 +00:00
|
|
|
virtual unsigned long Consume(const DataBlock& data, unsigned long tStamp, unsigned long flags)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2006-01-18 18:28:28 +00:00
|
|
|
if (!ref())
|
2009-07-02 09:24:33 +00:00
|
|
|
return 0;
|
|
|
|
unsigned long len = 0;
|
2007-04-06 13:37:56 +00:00
|
|
|
while (getTransSource()) {
|
|
|
|
int nchan = m_format.numChannels();
|
|
|
|
if (nchan != getTransSource()->getFormat().numChannels())
|
|
|
|
break;
|
|
|
|
String sFmt = m_format;
|
|
|
|
String dFmt = getTransSource()->getFormat();
|
|
|
|
if (nchan != 1) {
|
|
|
|
// get rid of the channel prefix
|
|
|
|
sFmt >> "*";
|
|
|
|
dFmt >> "*";
|
|
|
|
}
|
2005-02-06 20:13:21 +00:00
|
|
|
DataBlock oblock;
|
2007-04-06 13:37:56 +00:00
|
|
|
if (oblock.convert(data, sFmt, dFmt)) {
|
2009-07-02 09:24:33 +00:00
|
|
|
if (tStamp == invalidStamp()) {
|
2005-09-06 02:51:09 +00:00
|
|
|
unsigned int delta = data.length();
|
|
|
|
if (delta > oblock.length())
|
|
|
|
delta = oblock.length();
|
|
|
|
tStamp = m_timestamp + delta;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
2005-09-06 02:51:09 +00:00
|
|
|
m_timestamp = tStamp;
|
2009-07-02 09:24:33 +00:00
|
|
|
len = getTransSource()->Forward(oblock, tStamp, flags);
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
2007-04-06 13:37:56 +00:00
|
|
|
break;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
deref();
|
2009-07-02 09:24:33 +00:00
|
|
|
return len;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2006-05-25 20:40:58 +00:00
|
|
|
// slin basic mono resampler
|
|
|
|
class ResampTranslator : public DataTranslator
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
int m_sRate, m_dRate;
|
|
|
|
public:
|
|
|
|
ResampTranslator(const DataFormat& sFormat, const DataFormat& dFormat)
|
|
|
|
: DataTranslator(sFormat,dFormat),
|
|
|
|
m_sRate(sFormat.sampleRate()), m_dRate(dFormat.sampleRate())
|
|
|
|
{ }
|
2009-07-02 09:24:33 +00:00
|
|
|
virtual unsigned long Consume(const DataBlock& data, unsigned long tStamp, unsigned long flags)
|
2006-05-25 20:40:58 +00:00
|
|
|
{
|
|
|
|
unsigned int n = data.length();
|
|
|
|
if (!n || (n & 1) || !m_sRate || !m_dRate || !ref())
|
2009-07-02 09:24:33 +00:00
|
|
|
return 0;
|
|
|
|
unsigned long len = 0;
|
2006-05-25 20:40:58 +00:00
|
|
|
n /= 2;
|
2006-11-24 14:51:21 +00:00
|
|
|
DataSource* src = getTransSource();
|
|
|
|
if (src) {
|
2006-05-25 20:40:58 +00:00
|
|
|
long delta = tStamp - m_timestamp;
|
2006-11-24 14:51:21 +00:00
|
|
|
short* s = (short*) data.data();
|
2006-05-25 20:40:58 +00:00
|
|
|
DataBlock oblock;
|
|
|
|
if (m_dRate > m_sRate) {
|
|
|
|
int mul = m_dRate / m_sRate;
|
|
|
|
// repeat the sample an integer number of times
|
|
|
|
delta *= mul;
|
2006-11-10 12:10:04 +00:00
|
|
|
oblock.assign(0,2*n*mul);
|
2006-11-24 14:51:21 +00:00
|
|
|
short* d = (short*) oblock.data();
|
2006-05-25 20:40:58 +00:00
|
|
|
while (n--) {
|
|
|
|
// TODO: smooth the data a little
|
|
|
|
short v = *s++;
|
|
|
|
for (int i = 0; i < mul; i++)
|
|
|
|
*d++ = v;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
int div = m_sRate / m_dRate;
|
|
|
|
// average an integer number of samples
|
|
|
|
delta /= div;
|
2006-11-10 17:18:32 +00:00
|
|
|
n /= div;
|
|
|
|
oblock.assign(0,2*n);
|
2006-11-24 14:51:21 +00:00
|
|
|
short* d = (short*) oblock.data();
|
2006-05-25 20:40:58 +00:00
|
|
|
while (n--) {
|
|
|
|
// TODO: interpolate
|
|
|
|
int v = 0;
|
|
|
|
for (int i = 0; i < div; i++)
|
|
|
|
v += *s++;
|
|
|
|
v /= div;
|
|
|
|
// saturate average result
|
|
|
|
if (v > 32767)
|
|
|
|
v = 32767;
|
|
|
|
if (v < -32767)
|
|
|
|
v = -32767;
|
|
|
|
*d++ = v;
|
|
|
|
}
|
|
|
|
}
|
2006-11-24 14:51:21 +00:00
|
|
|
if (src->timeStamp() != invalidStamp())
|
|
|
|
delta += src->timeStamp();
|
2009-07-02 09:24:33 +00:00
|
|
|
len = src->Forward(oblock, delta, flags);
|
2006-05-25 20:40:58 +00:00
|
|
|
}
|
|
|
|
deref();
|
2009-07-02 09:24:33 +00:00
|
|
|
return len;
|
2006-05-25 20:40:58 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// slin simple mono-stereo converter
|
|
|
|
class StereoTranslator : public DataTranslator
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
int m_sChans, m_dChans;
|
|
|
|
public:
|
|
|
|
StereoTranslator(const DataFormat& sFormat, const DataFormat& dFormat)
|
|
|
|
: DataTranslator(sFormat,dFormat),
|
|
|
|
m_sChans(sFormat.numChannels()), m_dChans(dFormat.numChannels())
|
|
|
|
{ }
|
2009-07-02 09:24:33 +00:00
|
|
|
virtual unsigned long Consume(const DataBlock& data, unsigned long tStamp, unsigned long flags)
|
2006-05-25 20:40:58 +00:00
|
|
|
{
|
|
|
|
unsigned int n = data.length();
|
|
|
|
if (!n || (n & 1) || !ref())
|
2009-07-02 09:24:33 +00:00
|
|
|
return 0;
|
|
|
|
unsigned long len = 0;
|
2006-05-25 20:40:58 +00:00
|
|
|
n /= 2;
|
|
|
|
if (getTransSource()) {
|
2007-05-05 14:06:41 +00:00
|
|
|
short* s = (short*) data.data();
|
2006-05-25 20:40:58 +00:00
|
|
|
DataBlock oblock;
|
|
|
|
if ((m_sChans == 1) && (m_dChans == 2)) {
|
|
|
|
oblock.assign(0,n*4);
|
2007-05-05 14:06:41 +00:00
|
|
|
short* d = (short*) oblock.data();
|
2006-05-25 20:40:58 +00:00
|
|
|
// duplicate the sample for each channel
|
2007-02-28 00:25:47 +00:00
|
|
|
while (n--) {
|
2007-05-05 14:06:41 +00:00
|
|
|
short v = *d++ = *s++;
|
2007-02-28 00:25:47 +00:00
|
|
|
*d++ = v;
|
|
|
|
}
|
2006-05-25 20:40:58 +00:00
|
|
|
}
|
|
|
|
else if ((m_sChans == 2) && (m_dChans == 1)) {
|
2007-05-05 15:57:08 +00:00
|
|
|
n /= 2;
|
2007-05-05 14:06:41 +00:00
|
|
|
oblock.assign(0,2*n);
|
|
|
|
short* d = (short*) oblock.data();
|
2006-05-25 20:40:58 +00:00
|
|
|
// average the channels
|
|
|
|
while (n--) {
|
|
|
|
int v = *s++;
|
|
|
|
v += *s++;
|
|
|
|
v /= 2;
|
|
|
|
// saturate average result
|
|
|
|
if (v > 32767)
|
|
|
|
v = 32767;
|
|
|
|
if (v < -32767)
|
|
|
|
v = -32767;
|
|
|
|
*d++ = v;
|
|
|
|
}
|
|
|
|
}
|
2009-07-02 09:24:33 +00:00
|
|
|
len = getTransSource()->Forward(oblock, tStamp, flags);
|
2006-05-25 20:40:58 +00:00
|
|
|
}
|
|
|
|
deref();
|
2009-07-02 09:24:33 +00:00
|
|
|
return len;
|
2006-05-25 20:40:58 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
class SimpleFactory : public TranslatorFactory
|
|
|
|
{
|
|
|
|
public:
|
2010-04-02 14:28:27 +00:00
|
|
|
SimpleFactory(const TranslatorCaps* caps, const char* name)
|
|
|
|
: TranslatorFactory(name), m_caps(caps)
|
2006-05-25 20:40:58 +00:00
|
|
|
{ }
|
|
|
|
virtual DataTranslator* create(const DataFormat& sFormat, const DataFormat& dFormat)
|
|
|
|
{ return converts(sFormat,dFormat) ? new SimpleTranslator(sFormat,dFormat) : 0; }
|
|
|
|
virtual const TranslatorCaps* getCapabilities() const
|
|
|
|
{ return m_caps; }
|
|
|
|
private:
|
|
|
|
const TranslatorCaps* m_caps;
|
|
|
|
};
|
|
|
|
|
|
|
|
class ResampFactory : public TranslatorFactory
|
|
|
|
{
|
2010-04-02 14:28:27 +00:00
|
|
|
public:
|
|
|
|
ResampFactory() : TranslatorFactory("resample")
|
|
|
|
{ }
|
2006-05-25 20:40:58 +00:00
|
|
|
virtual DataTranslator* create(const DataFormat& sFormat, const DataFormat& dFormat)
|
|
|
|
{ return converts(sFormat,dFormat) ? new ResampTranslator(sFormat,dFormat) : 0; }
|
|
|
|
virtual const TranslatorCaps* getCapabilities() const
|
|
|
|
{ return s_resampCaps; }
|
|
|
|
};
|
|
|
|
|
|
|
|
class StereoFactory : public TranslatorFactory
|
|
|
|
{
|
2010-04-02 14:28:27 +00:00
|
|
|
public:
|
|
|
|
StereoFactory() : TranslatorFactory("stereo")
|
|
|
|
{ }
|
2006-05-25 20:40:58 +00:00
|
|
|
virtual DataTranslator* create(const DataFormat& sFormat, const DataFormat& dFormat)
|
|
|
|
{ return converts(sFormat,dFormat) ? new StereoTranslator(sFormat,dFormat) : 0; }
|
|
|
|
virtual const TranslatorCaps* getCapabilities() const
|
|
|
|
{ return s_stereoCaps; }
|
|
|
|
};
|
|
|
|
|
|
|
|
class ChainedFactory : public TranslatorFactory
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
ChainedFactory(TranslatorFactory* factory1, TranslatorFactory* factory2, const FormatInfo* info);
|
|
|
|
virtual ~ChainedFactory();
|
|
|
|
virtual void removed(const TranslatorFactory* factory);
|
|
|
|
virtual DataTranslator* create(const DataFormat& sFormat, const DataFormat& dFormat);
|
|
|
|
virtual const TranslatorCaps* getCapabilities() const
|
2007-01-22 03:53:17 +00:00
|
|
|
{
|
|
|
|
return (m_factory1 && m_factory1->getCapabilities() &&
|
|
|
|
m_factory2 && m_factory2->getCapabilities()) ? m_capabilities : 0;
|
|
|
|
}
|
2006-05-25 20:40:58 +00:00
|
|
|
virtual unsigned int length() const
|
|
|
|
{ return m_length; }
|
|
|
|
virtual const FormatInfo* intermediate() const;
|
|
|
|
virtual bool intermediate(const FormatInfo* info) const;
|
2010-04-02 14:28:27 +00:00
|
|
|
virtual const char* name() const
|
|
|
|
{ return m_name.c_str(); }
|
2006-05-25 20:40:58 +00:00
|
|
|
private:
|
|
|
|
TranslatorFactory* m_factory1;
|
|
|
|
TranslatorFactory* m_factory2;
|
2010-04-02 14:28:27 +00:00
|
|
|
String m_name;
|
2006-05-25 20:40:58 +00:00
|
|
|
DataFormat m_format;
|
|
|
|
unsigned int m_length;
|
|
|
|
const TranslatorCaps* m_capabilities;
|
|
|
|
};
|
|
|
|
|
2005-02-06 20:13:21 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
using namespace TelEngine;
|
|
|
|
|
|
|
|
|
|
|
|
int FormatInfo::guessSamples(int len) const
|
|
|
|
{
|
2005-06-14 20:53:20 +00:00
|
|
|
if (!(frameTime && frameSize))
|
2005-02-06 20:13:21 +00:00
|
|
|
return 0;
|
2005-06-14 20:53:20 +00:00
|
|
|
return (len / frameSize) * sampleRate * (long)frameTime / 1000000;
|
|
|
|
}
|
|
|
|
|
|
|
|
int FormatInfo::dataRate() const
|
|
|
|
{
|
|
|
|
if (!frameTime)
|
|
|
|
return 0;
|
|
|
|
return frameSize * 1000000 / frameTime;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
typedef struct _flist {
|
|
|
|
struct _flist* next;
|
|
|
|
const FormatInfo* info;
|
|
|
|
} flist;
|
|
|
|
|
|
|
|
static flist* s_flist = 0;
|
|
|
|
|
|
|
|
const FormatInfo* FormatRepository::getFormat(const String& name)
|
|
|
|
{
|
|
|
|
if (name.null())
|
|
|
|
return 0;
|
|
|
|
// search in the static list first
|
|
|
|
for (unsigned int i = 0; i < (sizeof(s_formats)/sizeof(FormatInfo)); i++)
|
|
|
|
if (name == s_formats[i].name)
|
|
|
|
return s_formats+i;
|
|
|
|
// then try the installed formats
|
|
|
|
for (flist* l = s_flist; l; l = l->next)
|
|
|
|
if (name == l->info->name)
|
|
|
|
return l->info;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-06-14 20:53:20 +00:00
|
|
|
const FormatInfo* FormatRepository::addFormat(const String& name, int fsize, int ftime, const String& type, int srate, int nchan)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
|
|
|
if (name.null() || type.null())
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
const FormatInfo* f = getFormat(name);
|
|
|
|
if (f) {
|
|
|
|
// found by name - check if it exactly matches what we have already
|
2005-06-14 20:53:20 +00:00
|
|
|
if ((fsize != f->frameSize) ||
|
|
|
|
(ftime != f->frameTime) ||
|
2005-02-06 20:13:21 +00:00
|
|
|
(srate != f->sampleRate) ||
|
|
|
|
(nchan != f->numChannels) ||
|
|
|
|
(type != f->type)) {
|
2005-06-14 20:53:20 +00:00
|
|
|
Debug(DebugWarn,"Tried to register '%s' format '%s' fsize=%d ftime=%d srate=%d nchan=%d",
|
|
|
|
type.c_str(),name.c_str(),fsize,ftime,srate,nchan);
|
2005-02-06 20:13:21 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return f;
|
|
|
|
}
|
|
|
|
// not in list - add a new one to the installed formats
|
2005-07-01 22:35:06 +00:00
|
|
|
DDebug(DebugInfo,"Registering '%s' format '%s' fsize=%d ftime=%d srate=%d nchan=%d",
|
2005-06-14 20:53:20 +00:00
|
|
|
type.c_str(),name.c_str(),fsize,ftime,srate,nchan);
|
|
|
|
f = new FormatInfo(::strdup(name),fsize,ftime,::strdup(type),srate,nchan);
|
2005-02-06 20:13:21 +00:00
|
|
|
flist* l = new flist;
|
|
|
|
l->info = f;
|
|
|
|
l->next = s_flist;
|
|
|
|
s_flist = l;
|
|
|
|
return f;
|
|
|
|
}
|
|
|
|
|
2005-12-28 22:27:53 +00:00
|
|
|
|
2005-04-11 00:56:55 +00:00
|
|
|
void DataFormat::changed()
|
|
|
|
{
|
|
|
|
m_parsed = 0;
|
|
|
|
String::changed();
|
|
|
|
}
|
|
|
|
|
|
|
|
const FormatInfo* DataFormat::getInfo() const
|
|
|
|
{
|
|
|
|
if (!(m_parsed || null()))
|
|
|
|
m_parsed = FormatRepository::getFormat(*this);
|
|
|
|
return m_parsed;
|
|
|
|
}
|
|
|
|
|
2005-12-28 22:27:53 +00:00
|
|
|
|
2007-06-08 18:33:33 +00:00
|
|
|
void DataConsumer::destroyed()
|
2005-12-28 22:27:53 +00:00
|
|
|
{
|
|
|
|
if (m_source || m_override) {
|
|
|
|
// this should not happen - but scream bloody murder if so
|
|
|
|
Debug(DebugFail,"DataConsumer destroyed with source=%p override=%p [%p]",
|
|
|
|
m_source,m_override,this);
|
|
|
|
}
|
|
|
|
if (m_source)
|
|
|
|
m_source->detach(this);
|
|
|
|
if (m_override)
|
|
|
|
m_override->detach(this);
|
2007-06-08 18:33:33 +00:00
|
|
|
DataNode::destroyed();
|
2005-12-28 22:27:53 +00:00
|
|
|
}
|
|
|
|
|
2005-04-14 03:14:20 +00:00
|
|
|
void* DataConsumer::getObject(const String& name) const
|
|
|
|
{
|
|
|
|
if (name == "DataConsumer")
|
|
|
|
return const_cast<DataConsumer*>(this);
|
|
|
|
return DataNode::getObject(name);
|
|
|
|
}
|
|
|
|
|
2009-07-02 09:24:33 +00:00
|
|
|
unsigned long DataConsumer::Consume(const DataBlock& data, unsigned long tStamp, unsigned long flags, DataSource* source)
|
2005-09-28 17:41:31 +00:00
|
|
|
{
|
|
|
|
if (source == m_override)
|
|
|
|
tStamp += m_overrideTsDelta;
|
|
|
|
else if (m_override || (source != m_source))
|
2009-07-02 09:24:33 +00:00
|
|
|
return 0;
|
2006-06-28 17:39:15 +00:00
|
|
|
else
|
|
|
|
tStamp += m_regularTsDelta;
|
2005-12-30 23:51:22 +00:00
|
|
|
u_int64_t tsTime = Time::now();
|
2009-07-02 09:24:33 +00:00
|
|
|
unsigned long len = Consume(data,tStamp,flags);
|
2005-09-28 17:41:31 +00:00
|
|
|
m_timestamp = tStamp;
|
2005-12-30 23:51:22 +00:00
|
|
|
m_lastTsTime = tsTime;
|
2009-07-02 09:24:33 +00:00
|
|
|
return len;
|
2005-09-28 17:41:31 +00:00
|
|
|
}
|
|
|
|
|
2006-06-28 17:39:15 +00:00
|
|
|
bool DataConsumer::synchronize(DataSource* source)
|
|
|
|
{
|
|
|
|
if (!source)
|
|
|
|
return false;
|
|
|
|
bool override = false;
|
|
|
|
if (source == m_override)
|
|
|
|
override = true;
|
|
|
|
else if (source != m_source)
|
|
|
|
return false;
|
|
|
|
if (!(m_timestamp || m_regularTsDelta || m_overrideTsDelta)) {
|
|
|
|
// first time
|
|
|
|
m_timestamp = source->timeStamp();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
const FormatInfo* info = getFormat().getInfo();
|
|
|
|
int64_t dt = 0;
|
|
|
|
if (info) {
|
|
|
|
// adjust timestamp for possible silence or gaps in data, at least 25ms
|
|
|
|
dt = Time::now() - m_lastTsTime;
|
|
|
|
if (dt >= 25000) {
|
|
|
|
dt = (dt * info->sampleRate) / 1000000;
|
|
|
|
DDebug(DebugInfo,"Data gap, offsetting consumer timestamps by " FMT64 " [%p]",dt,this);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
dt = 0;
|
|
|
|
}
|
|
|
|
dt += m_timestamp - source->timeStamp();
|
|
|
|
DDebug(DebugInfo,"Offsetting consumer %s timestamps by " FMT64 " [%p]",
|
|
|
|
(override ? "override" : "regular"),dt,this);
|
|
|
|
if (override)
|
2010-06-11 18:07:17 +00:00
|
|
|
m_overrideTsDelta = (long int)dt;
|
2006-06-28 17:39:15 +00:00
|
|
|
else
|
2010-06-11 18:07:17 +00:00
|
|
|
m_regularTsDelta = (long int)dt;
|
2006-06-28 17:39:15 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2005-12-28 22:27:53 +00:00
|
|
|
|
2009-09-23 14:50:51 +00:00
|
|
|
bool DataSource::valid() const
|
|
|
|
{
|
|
|
|
Lock mylock(const_cast<DataSource*>(this));
|
|
|
|
if (!m_translator)
|
|
|
|
return true;
|
|
|
|
// this is a translator's source - check if we have at least one valid consumer
|
|
|
|
for (ObjList* l = m_consumers.skipNull(); l; l=l->skipNext()) {
|
|
|
|
DataConsumer* c = static_cast<DataConsumer *>(l->get());
|
|
|
|
if (c->valid())
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-07-02 09:24:33 +00:00
|
|
|
unsigned long DataSource::Forward(const DataBlock& data, unsigned long tStamp, unsigned long flags)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2009-05-05 20:49:05 +00:00
|
|
|
Lock mylock(this,100000);
|
2006-01-19 21:13:49 +00:00
|
|
|
// we DON'T refcount here, we rely on the mutex to keep us safe
|
2009-07-22 12:57:14 +00:00
|
|
|
if (!(mylock.locked() && alive())) {
|
2006-01-19 21:13:49 +00:00
|
|
|
DDebug(DebugInfo,"Forwarding on a dead DataSource! [%p]",this);
|
2009-07-02 09:24:33 +00:00
|
|
|
return 0;
|
2006-01-19 21:13:49 +00:00
|
|
|
}
|
2006-09-13 18:52:25 +00:00
|
|
|
|
|
|
|
// try to evaluate amount of samples in this packet
|
|
|
|
const FormatInfo* f = m_format.getInfo();
|
|
|
|
unsigned long nSamp = f ? f->guessSamples(data.length()) : 0;
|
|
|
|
|
|
|
|
// if no timestamp provided - try to use next expected
|
|
|
|
if (tStamp == invalidStamp())
|
|
|
|
tStamp = m_nextStamp;
|
|
|
|
// still no timestamp known - wild guess based on this packet size
|
|
|
|
if (tStamp == invalidStamp()) {
|
2010-04-02 14:28:27 +00:00
|
|
|
DDebug(DebugNote,"Unknown timestamp - assuming %lu + %lu [%p]",
|
2006-09-13 18:52:25 +00:00
|
|
|
m_timestamp,nSamp,this);
|
|
|
|
tStamp = m_timestamp + nSamp;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
2009-07-02 09:24:33 +00:00
|
|
|
unsigned long len = invalidStamp();
|
2009-09-23 14:50:51 +00:00
|
|
|
bool empty = true;
|
|
|
|
ObjList* l = m_consumers.skipNull();
|
|
|
|
while (l) {
|
|
|
|
DataConsumer* c = static_cast<DataConsumer *>(l->get());
|
2009-07-02 09:24:33 +00:00
|
|
|
unsigned long ll = c->Consume(data,tStamp,flags,this);
|
2009-09-23 14:50:51 +00:00
|
|
|
if (ll || c->valid()) {
|
|
|
|
// get the minimum data amount forwarded to all consumers
|
|
|
|
if (len > ll)
|
|
|
|
len = ll;
|
|
|
|
l = l->skipNext();
|
|
|
|
empty = false;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
DDebug(DebugInfo,"Consumer %p becomes invalid [%p]",c,this);
|
|
|
|
detachInternal(c);
|
|
|
|
// do not advance in list, we just removed the current element
|
|
|
|
l = l->skipNull();
|
|
|
|
}
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
2009-09-23 14:50:51 +00:00
|
|
|
if (empty)
|
2009-07-02 09:24:33 +00:00
|
|
|
len = 0;
|
2005-09-28 17:41:31 +00:00
|
|
|
m_timestamp = tStamp;
|
2006-09-13 18:52:25 +00:00
|
|
|
m_nextStamp = nSamp ? (tStamp + nSamp) : invalidStamp();
|
2009-07-02 09:24:33 +00:00
|
|
|
return len;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
2005-09-28 17:41:31 +00:00
|
|
|
bool DataSource::attach(DataConsumer* consumer, bool override)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2006-01-19 21:13:49 +00:00
|
|
|
if (!alive()) {
|
|
|
|
DDebug(DebugFail,"Attaching a dead DataSource! [%p]",this);
|
|
|
|
return false;
|
|
|
|
}
|
2005-09-28 17:41:31 +00:00
|
|
|
DDebug(DebugAll,"DataSource [%p] attaching consumer%s [%p]",
|
|
|
|
this,(override ? " as override" : ""),consumer);
|
2006-01-18 18:28:28 +00:00
|
|
|
if (!(consumer && consumer->ref()))
|
2005-02-06 20:13:21 +00:00
|
|
|
return false;
|
2009-05-05 20:49:05 +00:00
|
|
|
Lock mylock(this);
|
2009-09-23 14:50:51 +00:00
|
|
|
DataSource*& src = override ? consumer->m_override : consumer->m_source;
|
|
|
|
if (src != this) {
|
2010-10-27 16:03:44 +00:00
|
|
|
s_consSrcMutex.lock();
|
2009-12-07 11:43:00 +00:00
|
|
|
RefPointer<DataSource> src2(src);
|
2010-10-27 16:03:44 +00:00
|
|
|
if (src2 && (this != src2)) {
|
|
|
|
s_consSrcMutex.unlock();
|
2009-12-07 11:43:00 +00:00
|
|
|
src2->detach(consumer);
|
2010-10-27 16:03:44 +00:00
|
|
|
s_consSrcMutex.lock();
|
|
|
|
if (src) {
|
|
|
|
Debug(DebugGoOn,"DataSource %p raced us attaching consumer %p [%p]",
|
|
|
|
src,consumer,this);
|
|
|
|
s_consSrcMutex.unlock();
|
|
|
|
consumer->deref();
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
2009-09-23 14:50:51 +00:00
|
|
|
src = this;
|
2010-10-27 16:03:44 +00:00
|
|
|
s_consSrcMutex.unlock();
|
2005-09-28 17:41:31 +00:00
|
|
|
}
|
2006-06-28 17:39:15 +00:00
|
|
|
consumer->synchronize(this);
|
2005-02-06 20:13:21 +00:00
|
|
|
m_consumers.append(consumer);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2005-03-20 03:11:53 +00:00
|
|
|
bool DataSource::detach(DataConsumer* consumer)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
|
|
|
if (!consumer)
|
|
|
|
return false;
|
2006-01-19 21:13:49 +00:00
|
|
|
if (!ref()) {
|
|
|
|
DDebug(DebugFail,"Detaching a dead DataSource! [%p]",this);
|
|
|
|
return false;
|
|
|
|
}
|
2005-07-01 22:35:06 +00:00
|
|
|
DDebug(DebugAll,"DataSource [%p] detaching consumer [%p]",this,consumer);
|
2005-12-28 22:27:53 +00:00
|
|
|
// lock the source to prevent races with the Forward method
|
2009-05-05 20:49:05 +00:00
|
|
|
lock();
|
2005-12-28 22:27:53 +00:00
|
|
|
bool ok = detachInternal(consumer);
|
2009-05-05 20:49:05 +00:00
|
|
|
unlock();
|
2006-01-19 21:13:49 +00:00
|
|
|
deref();
|
2005-12-28 22:27:53 +00:00
|
|
|
return ok;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool DataSource::detachInternal(DataConsumer* consumer)
|
|
|
|
{
|
|
|
|
if (!consumer)
|
|
|
|
return false;
|
2005-02-06 20:13:21 +00:00
|
|
|
DataConsumer *temp = static_cast<DataConsumer *>(m_consumers.remove(consumer,false));
|
|
|
|
if (temp) {
|
2010-10-27 16:03:44 +00:00
|
|
|
s_consSrcMutex.lock();
|
2005-09-28 17:41:31 +00:00
|
|
|
if (temp->m_source == this)
|
|
|
|
temp->m_source = 0;
|
|
|
|
if (temp->m_override == this)
|
|
|
|
temp->m_override = 0;
|
2010-10-27 16:03:44 +00:00
|
|
|
s_consSrcMutex.unlock();
|
2005-02-06 20:13:21 +00:00
|
|
|
temp->deref();
|
|
|
|
return true;
|
|
|
|
}
|
2005-04-11 21:20:12 +00:00
|
|
|
DDebug(DebugInfo,"DataSource [%p] has no consumer [%p]",this,consumer);
|
2005-02-06 20:13:21 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2007-06-08 18:33:33 +00:00
|
|
|
void DataSource::destroyed()
|
2005-12-29 17:49:52 +00:00
|
|
|
{
|
2010-09-23 14:37:48 +00:00
|
|
|
m_translator = 0;
|
2005-12-29 17:49:52 +00:00
|
|
|
clear();
|
2007-06-08 18:33:33 +00:00
|
|
|
DataNode::destroyed();
|
2005-12-29 17:49:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void DataSource::clear()
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2005-12-28 22:27:53 +00:00
|
|
|
// keep the source locked to prevent races with the Forward method
|
2009-05-05 20:49:05 +00:00
|
|
|
lock();
|
2005-12-29 17:49:52 +00:00
|
|
|
while (detachInternal(static_cast<DataConsumer*>(m_consumers.get())))
|
|
|
|
;
|
2009-05-05 20:49:05 +00:00
|
|
|
unlock();
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
2006-06-28 17:39:15 +00:00
|
|
|
void DataSource::synchronize(unsigned long tStamp)
|
|
|
|
{
|
2009-05-05 20:49:05 +00:00
|
|
|
Lock mylock(this,100000);
|
2009-07-22 12:57:14 +00:00
|
|
|
if (!(mylock.locked() && alive())) {
|
2006-06-28 17:39:15 +00:00
|
|
|
DDebug(DebugInfo,"Synchronizing on a dead DataSource! [%p]",this);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
m_timestamp = tStamp;
|
2006-09-13 18:52:25 +00:00
|
|
|
m_nextStamp = invalidStamp();
|
2006-06-28 17:39:15 +00:00
|
|
|
ObjList *l = m_consumers.skipNull();
|
|
|
|
for (; l; l=l->skipNext()) {
|
|
|
|
DataConsumer *c = static_cast<DataConsumer *>(l->get());
|
|
|
|
c->synchronize(this);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-04-14 03:14:20 +00:00
|
|
|
void* DataSource::getObject(const String& name) const
|
|
|
|
{
|
|
|
|
if (name == "DataSource")
|
|
|
|
return const_cast<DataSource*>(this);
|
|
|
|
return DataNode::getObject(name);
|
|
|
|
}
|
|
|
|
|
2005-12-28 22:27:53 +00:00
|
|
|
|
2005-04-25 22:19:54 +00:00
|
|
|
DataEndpoint::DataEndpoint(CallEndpoint* call, const char* name)
|
2005-05-30 15:13:02 +00:00
|
|
|
: m_name(name), m_source(0), m_consumer(0),
|
|
|
|
m_peer(0), m_call(call),
|
|
|
|
m_peerRecord(0), m_callRecord(0)
|
2005-03-28 22:27:26 +00:00
|
|
|
{
|
2005-07-01 22:35:06 +00:00
|
|
|
DDebug(DebugAll,"DataEndpoint::DataEndpoint(%p,'%s') [%p]",call,name,this);
|
2005-04-25 22:19:54 +00:00
|
|
|
if (m_call)
|
|
|
|
m_call->m_data.append(this);
|
2005-03-28 22:27:26 +00:00
|
|
|
}
|
|
|
|
|
2007-06-08 18:33:33 +00:00
|
|
|
void DataEndpoint::destroyed()
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2007-06-08 18:33:33 +00:00
|
|
|
DDebug(DebugAll,"DataEndpoint::destroyed() '%s' call=%p [%p]",
|
2005-04-25 22:19:54 +00:00
|
|
|
m_name.c_str(),m_call,this);
|
|
|
|
if (m_call)
|
|
|
|
m_call->m_data.remove(this,false);
|
2005-04-11 21:20:12 +00:00
|
|
|
disconnect();
|
2005-05-30 15:13:02 +00:00
|
|
|
setPeerRecord();
|
|
|
|
setCallRecord();
|
2006-09-08 09:50:19 +00:00
|
|
|
clearSniffers();
|
2005-04-11 21:20:12 +00:00
|
|
|
setSource();
|
|
|
|
setConsumer();
|
2007-06-08 18:33:33 +00:00
|
|
|
RefObject::destroyed();
|
2005-03-28 22:27:26 +00:00
|
|
|
}
|
|
|
|
|
2005-04-14 03:14:20 +00:00
|
|
|
void* DataEndpoint::getObject(const String& name) const
|
|
|
|
{
|
|
|
|
if (name == "DataEndpoint")
|
|
|
|
return const_cast<DataEndpoint*>(this);
|
|
|
|
return RefObject::getObject(name);
|
|
|
|
}
|
|
|
|
|
2005-03-28 22:27:26 +00:00
|
|
|
const String& DataEndpoint::toString() const
|
|
|
|
{
|
|
|
|
return m_name;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
2005-08-02 02:20:00 +00:00
|
|
|
Mutex* DataEndpoint::mutex() const
|
|
|
|
{
|
|
|
|
return m_call ? m_call->mutex() : 0;
|
|
|
|
}
|
|
|
|
|
2006-01-19 21:13:49 +00:00
|
|
|
Mutex& DataEndpoint::commonMutex()
|
|
|
|
{
|
|
|
|
return s_dataMutex;
|
|
|
|
}
|
|
|
|
|
2005-03-20 03:11:53 +00:00
|
|
|
bool DataEndpoint::connect(DataEndpoint* peer)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
|
|
|
if (!peer) {
|
|
|
|
disconnect();
|
|
|
|
return false;
|
|
|
|
}
|
2006-01-19 21:13:49 +00:00
|
|
|
Lock lock(s_dataMutex);
|
2005-02-06 20:13:21 +00:00
|
|
|
if (peer == m_peer)
|
|
|
|
return true;
|
2005-04-11 21:20:12 +00:00
|
|
|
DDebug(DebugInfo,"DataEndpoint '%s' connecting peer %p to [%p]",m_name.c_str(),peer,this);
|
2005-02-06 20:13:21 +00:00
|
|
|
|
2006-01-19 21:13:49 +00:00
|
|
|
ref();
|
2005-02-06 20:13:21 +00:00
|
|
|
peer->ref();
|
2006-01-19 21:13:49 +00:00
|
|
|
disconnect();
|
2005-02-06 20:13:21 +00:00
|
|
|
peer->disconnect();
|
|
|
|
bool native = (name() == peer->name()) && nativeConnect(peer);
|
|
|
|
|
|
|
|
if (!native) {
|
2006-02-23 13:46:20 +00:00
|
|
|
XDebug(DebugInfo,"DataEndpoint s=%p c=%p peer @%p s=%p c=%p [%p]",
|
|
|
|
getSource(),getConsumer(),peer,peer->getSource(),peer->getConsumer(),this);
|
2006-01-19 21:13:49 +00:00
|
|
|
DataSource* s = getSource();
|
|
|
|
DataConsumer* c = peer->getConsumer();
|
2005-05-30 15:13:02 +00:00
|
|
|
if (s && c)
|
|
|
|
DataTranslator::attachChain(s,c);
|
|
|
|
c = peer->getPeerRecord();
|
2005-02-06 20:13:21 +00:00
|
|
|
if (s && c)
|
|
|
|
DataTranslator::attachChain(s,c);
|
|
|
|
|
|
|
|
s = peer->getSource();
|
|
|
|
c = getConsumer();
|
|
|
|
if (s && c)
|
|
|
|
DataTranslator::attachChain(s,c);
|
2005-05-30 15:13:02 +00:00
|
|
|
c = getPeerRecord();
|
|
|
|
if (s && c)
|
|
|
|
DataTranslator::attachChain(s,c);
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
m_peer = peer;
|
2005-04-11 21:20:12 +00:00
|
|
|
peer->m_peer = this;
|
2005-02-06 20:13:21 +00:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2005-08-02 02:20:00 +00:00
|
|
|
bool DataEndpoint::disconnect()
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2006-01-19 21:13:49 +00:00
|
|
|
Lock lock(s_dataMutex);
|
2005-02-06 20:13:21 +00:00
|
|
|
if (!m_peer)
|
2005-08-02 02:20:00 +00:00
|
|
|
return false;
|
2005-04-11 21:20:12 +00:00
|
|
|
DDebug(DebugInfo,"DataEndpoint '%s' disconnecting peer %p from [%p]",m_name.c_str(),m_peer,this);
|
2005-02-06 20:13:21 +00:00
|
|
|
|
2006-01-19 21:13:49 +00:00
|
|
|
DataSource* s = getSource();
|
|
|
|
DataConsumer* c = m_peer->getConsumer();
|
2005-05-30 15:13:02 +00:00
|
|
|
if (s && c)
|
|
|
|
DataTranslator::detachChain(s,c);
|
|
|
|
c = m_peer->getPeerRecord();
|
2005-02-06 20:13:21 +00:00
|
|
|
if (s && c)
|
|
|
|
DataTranslator::detachChain(s,c);
|
|
|
|
|
|
|
|
s = m_peer->getSource();
|
|
|
|
c = getConsumer();
|
2005-05-30 15:13:02 +00:00
|
|
|
if (s && c)
|
|
|
|
DataTranslator::detachChain(s,c);
|
|
|
|
c = getPeerRecord();
|
2005-02-06 20:13:21 +00:00
|
|
|
if (s && c)
|
|
|
|
DataTranslator::detachChain(s,c);
|
|
|
|
|
2006-01-19 21:13:49 +00:00
|
|
|
DataEndpoint* temp = m_peer;
|
2005-02-06 20:13:21 +00:00
|
|
|
m_peer = 0;
|
2005-04-11 21:20:12 +00:00
|
|
|
temp->m_peer = 0;
|
2008-06-03 16:20:32 +00:00
|
|
|
lock.drop();
|
2005-02-06 20:13:21 +00:00
|
|
|
temp->deref();
|
2005-08-02 02:20:00 +00:00
|
|
|
return deref();
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
2005-03-20 03:11:53 +00:00
|
|
|
void DataEndpoint::setSource(DataSource* source)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2006-01-19 21:13:49 +00:00
|
|
|
Lock lock(s_dataMutex);
|
2005-02-06 20:13:21 +00:00
|
|
|
if (source == m_source)
|
|
|
|
return;
|
2006-01-19 21:13:49 +00:00
|
|
|
DataConsumer* c1 = m_peer ? m_peer->getConsumer() : 0;
|
|
|
|
DataConsumer* c2 = m_peer ? m_peer->getPeerRecord() : 0;
|
|
|
|
DataSource* temp = m_source;
|
2006-02-23 13:46:20 +00:00
|
|
|
XDebug(DebugInfo,"DataEndpoint::setSource(%p) peer=%p s=%p c1=%p c2=%p cr=%p [%p]",
|
|
|
|
source,m_peer,temp,c1,c2,m_callRecord,this);
|
2005-05-30 15:13:02 +00:00
|
|
|
if (c1)
|
|
|
|
c1->ref();
|
|
|
|
if (c2)
|
|
|
|
c2->ref();
|
|
|
|
if (m_callRecord)
|
|
|
|
m_callRecord->ref();
|
2005-02-06 20:13:21 +00:00
|
|
|
m_source = 0;
|
|
|
|
if (temp) {
|
2005-05-30 15:13:02 +00:00
|
|
|
if (c1) {
|
|
|
|
DataTranslator::detachChain(temp,c1);
|
|
|
|
if (c1->getConnSource())
|
|
|
|
Debug(DebugWarn,"consumer source not cleared in %p",c1);
|
|
|
|
}
|
|
|
|
if (c2) {
|
|
|
|
DataTranslator::detachChain(temp,c2);
|
|
|
|
if (c2->getConnSource())
|
|
|
|
Debug(DebugWarn,"consumer source not cleared in %p",c2);
|
|
|
|
}
|
|
|
|
if (m_callRecord) {
|
|
|
|
DataTranslator::detachChain(temp,m_callRecord);
|
|
|
|
if (m_callRecord->getConnSource())
|
|
|
|
Debug(DebugWarn,"consumer source not cleared in %p",m_callRecord);
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
2006-09-08 09:50:19 +00:00
|
|
|
ObjList* l = m_sniffers.skipNull();
|
|
|
|
for (; l; l = l->skipNext())
|
|
|
|
DataTranslator::detachChain(temp,static_cast<DataConsumer*>(l->get()));
|
2009-09-07 23:49:12 +00:00
|
|
|
temp->attached(false);
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
if (source) {
|
|
|
|
source->ref();
|
2005-05-30 15:13:02 +00:00
|
|
|
if (c1)
|
|
|
|
DataTranslator::attachChain(source,c1);
|
|
|
|
if (c2)
|
|
|
|
DataTranslator::attachChain(source,c2);
|
|
|
|
if (m_callRecord)
|
|
|
|
DataTranslator::attachChain(source,m_callRecord);
|
2006-09-08 09:50:19 +00:00
|
|
|
ObjList* l = m_sniffers.skipNull();
|
|
|
|
for (; l; l = l->skipNext())
|
|
|
|
DataTranslator::attachChain(source,static_cast<DataConsumer*>(l->get()));
|
2009-09-07 23:49:12 +00:00
|
|
|
source->attached(true);
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
m_source = source;
|
2005-05-30 15:13:02 +00:00
|
|
|
if (m_callRecord)
|
|
|
|
m_callRecord->deref();
|
2008-06-03 16:20:32 +00:00
|
|
|
lock.drop();
|
|
|
|
TelEngine::destruct(temp);
|
|
|
|
TelEngine::destruct(c1);
|
|
|
|
TelEngine::destruct(c2);
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
2005-03-20 03:11:53 +00:00
|
|
|
void DataEndpoint::setConsumer(DataConsumer* consumer)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2006-01-19 21:13:49 +00:00
|
|
|
Lock lock(s_dataMutex);
|
2005-02-06 20:13:21 +00:00
|
|
|
if (consumer == m_consumer)
|
|
|
|
return;
|
2006-01-19 21:13:49 +00:00
|
|
|
DataSource* source = m_peer ? m_peer->getSource() : 0;
|
|
|
|
DataConsumer* temp = m_consumer;
|
2006-02-23 13:46:20 +00:00
|
|
|
XDebug(DebugInfo,"DataEndpoint::setConsumer(%p) peer=%p c=%p ps=%p [%p]",
|
|
|
|
consumer,m_peer,temp,source,this);
|
2005-02-06 20:13:21 +00:00
|
|
|
if (consumer) {
|
2006-01-18 18:28:28 +00:00
|
|
|
if (consumer->ref()) {
|
|
|
|
if (source)
|
|
|
|
DataTranslator::attachChain(source,consumer);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
consumer = 0;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
m_consumer = consumer;
|
2008-06-03 16:20:32 +00:00
|
|
|
if (source && temp)
|
|
|
|
DataTranslator::detachChain(source,temp);
|
2009-09-07 23:49:12 +00:00
|
|
|
if (temp)
|
|
|
|
temp->attached(false);
|
|
|
|
if (consumer)
|
|
|
|
consumer->attached(true);
|
2008-06-03 16:20:32 +00:00
|
|
|
lock.drop();
|
|
|
|
TelEngine::destruct(temp);
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
2005-05-30 15:13:02 +00:00
|
|
|
void DataEndpoint::setPeerRecord(DataConsumer* consumer)
|
|
|
|
{
|
2006-01-19 21:13:49 +00:00
|
|
|
Lock lock(s_dataMutex);
|
2005-05-30 15:13:02 +00:00
|
|
|
if (consumer == m_peerRecord)
|
|
|
|
return;
|
2006-01-19 21:13:49 +00:00
|
|
|
DataSource* source = m_peer ? m_peer->getSource() : 0;
|
|
|
|
DataConsumer* temp = m_peerRecord;
|
2006-02-23 13:46:20 +00:00
|
|
|
XDebug(DebugInfo,"DataEndpoint::setPeerRecord(%p) peer=%p pr=%p ps=%p [%p]",
|
|
|
|
consumer,m_peer,temp,source,this);
|
2005-05-30 15:13:02 +00:00
|
|
|
if (consumer) {
|
2006-01-18 18:28:28 +00:00
|
|
|
if (consumer->ref()) {
|
|
|
|
if (source)
|
|
|
|
DataTranslator::attachChain(source,consumer);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
consumer = 0;
|
2005-05-30 15:13:02 +00:00
|
|
|
}
|
|
|
|
m_peerRecord = consumer;
|
2008-06-03 16:20:32 +00:00
|
|
|
if (source && temp)
|
|
|
|
DataTranslator::detachChain(source,temp);
|
2009-09-07 23:49:12 +00:00
|
|
|
if (temp)
|
|
|
|
temp->attached(false);
|
|
|
|
if (consumer)
|
|
|
|
consumer->attached(true);
|
2008-06-03 16:20:32 +00:00
|
|
|
lock.drop();
|
|
|
|
TelEngine::destruct(temp);
|
2005-05-30 15:13:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void DataEndpoint::setCallRecord(DataConsumer* consumer)
|
|
|
|
{
|
2006-01-19 21:13:49 +00:00
|
|
|
Lock lock(s_dataMutex);
|
2005-05-30 15:13:02 +00:00
|
|
|
if (consumer == m_callRecord)
|
|
|
|
return;
|
2006-01-19 21:13:49 +00:00
|
|
|
DataConsumer* temp = m_callRecord;
|
2006-02-23 13:46:20 +00:00
|
|
|
XDebug(DebugInfo,"DataEndpoint::setCallRecord(%p) cr=%p s=%p [%p]",
|
|
|
|
consumer,temp,m_source,this);
|
2005-05-30 15:13:02 +00:00
|
|
|
if (consumer) {
|
2006-01-18 18:28:28 +00:00
|
|
|
if (consumer->ref()) {
|
|
|
|
if (m_source)
|
|
|
|
DataTranslator::attachChain(m_source,consumer);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
consumer = 0;
|
2005-05-30 15:13:02 +00:00
|
|
|
}
|
|
|
|
m_callRecord = consumer;
|
2008-06-03 16:20:32 +00:00
|
|
|
if (temp && m_source)
|
|
|
|
DataTranslator::detachChain(m_source,temp);
|
2009-09-07 23:49:12 +00:00
|
|
|
if (temp)
|
|
|
|
temp->attached(false);
|
|
|
|
if (consumer)
|
|
|
|
consumer->attached(true);
|
2008-06-03 16:20:32 +00:00
|
|
|
lock.drop();
|
|
|
|
TelEngine::destruct(temp);
|
2005-05-30 15:13:02 +00:00
|
|
|
}
|
|
|
|
|
2006-09-08 09:50:19 +00:00
|
|
|
bool DataEndpoint::addSniffer(DataConsumer* sniffer)
|
|
|
|
{
|
|
|
|
if (!sniffer)
|
|
|
|
return false;
|
|
|
|
Lock lock(s_dataMutex);
|
|
|
|
if (m_sniffers.find(sniffer))
|
|
|
|
return false;
|
|
|
|
if (!sniffer->ref())
|
|
|
|
return false;
|
|
|
|
XDebug(DebugInfo,"DataEndpoint::addSniffer(%p) s=%p [%p]",
|
|
|
|
sniffer,m_source,this);
|
|
|
|
m_sniffers.append(sniffer);
|
|
|
|
if (m_source)
|
|
|
|
DataTranslator::attachChain(m_source,sniffer);
|
2009-09-07 23:49:12 +00:00
|
|
|
sniffer->attached(true);
|
2006-09-08 09:50:19 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool DataEndpoint::delSniffer(DataConsumer* sniffer)
|
|
|
|
{
|
|
|
|
if (!sniffer)
|
|
|
|
return false;
|
|
|
|
Lock lock(s_dataMutex);
|
|
|
|
XDebug(DebugInfo,"DataEndpoint::delSniffer(%p) s=%p [%p]",
|
|
|
|
sniffer,m_source,this);
|
|
|
|
if (!m_sniffers.remove(sniffer,false))
|
|
|
|
return false;
|
|
|
|
if (m_source)
|
|
|
|
DataTranslator::detachChain(m_source,sniffer);
|
2009-09-07 23:49:12 +00:00
|
|
|
sniffer->attached(false);
|
2006-09-08 09:50:19 +00:00
|
|
|
sniffer->deref();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void DataEndpoint::clearSniffers()
|
|
|
|
{
|
|
|
|
Lock lock(s_dataMutex);
|
|
|
|
for (;;) {
|
|
|
|
DataConsumer* sniffer = static_cast<DataConsumer*>(m_sniffers.remove(false));
|
|
|
|
if (!sniffer)
|
|
|
|
return;
|
|
|
|
XDebug(DebugInfo,"DataEndpoint::clearSniffers() sn=%p s=%p [%p]",
|
|
|
|
sniffer,m_source,this);
|
|
|
|
if (m_source)
|
|
|
|
DataTranslator::detachChain(m_source,sniffer);
|
2009-09-07 23:49:12 +00:00
|
|
|
sniffer->attached(false);
|
2006-09-08 09:50:19 +00:00
|
|
|
sniffer->deref();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-09-07 23:49:12 +00:00
|
|
|
bool DataEndpoint::clearData(DataNode* node)
|
|
|
|
{
|
|
|
|
if (!node)
|
|
|
|
return false;
|
|
|
|
Lock lock(s_dataMutex);
|
|
|
|
bool ok = delSniffer(static_cast<DataConsumer*>(node));
|
|
|
|
if (m_callRecord == node) {
|
|
|
|
setCallRecord();
|
|
|
|
ok = true;
|
|
|
|
}
|
|
|
|
if (m_peerRecord == node) {
|
|
|
|
setPeerRecord();
|
|
|
|
ok = true;
|
|
|
|
}
|
|
|
|
if (m_consumer == node) {
|
|
|
|
setConsumer();
|
|
|
|
ok = true;
|
|
|
|
}
|
|
|
|
if (m_source == node) {
|
|
|
|
setSource();
|
|
|
|
ok = true;
|
|
|
|
}
|
|
|
|
return ok;
|
|
|
|
}
|
|
|
|
|
2008-08-04 02:06:00 +00:00
|
|
|
// Change source(s) or consumer(s)
|
|
|
|
bool DataEndpoint::control(NamedList& params)
|
|
|
|
{
|
|
|
|
return (m_source && m_source->control(params)) ||
|
|
|
|
(m_consumer && m_consumer->control(params)) ||
|
|
|
|
(m_peerRecord && m_peerRecord->control(params)) ||
|
|
|
|
(m_callRecord && m_callRecord->control(params));
|
|
|
|
}
|
|
|
|
|
2005-12-28 22:27:53 +00:00
|
|
|
|
2007-06-08 18:33:33 +00:00
|
|
|
void ThreadedSource::destroyed()
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2007-04-18 00:51:28 +00:00
|
|
|
if (m_thread)
|
2009-09-07 23:49:12 +00:00
|
|
|
Debug(DebugFail,"ThreadedSource destroyed holding thread %p [%p]",m_thread,this);
|
2007-06-08 18:33:33 +00:00
|
|
|
DataSource::destroyed();
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
2005-04-28 22:46:59 +00:00
|
|
|
bool ThreadedSource::start(const char* name, Thread::Priority prio)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2009-05-05 20:49:05 +00:00
|
|
|
Lock mylock(this);
|
2005-02-06 20:13:21 +00:00
|
|
|
if (!m_thread) {
|
2006-01-19 21:13:49 +00:00
|
|
|
ThreadedSourcePrivate* thread = new ThreadedSourcePrivate(this,name,prio);
|
|
|
|
if (thread->startup()) {
|
|
|
|
m_thread = thread;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
delete thread;
|
|
|
|
return false;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
return m_thread->running();
|
|
|
|
}
|
|
|
|
|
|
|
|
void ThreadedSource::stop()
|
|
|
|
{
|
2009-05-05 20:49:05 +00:00
|
|
|
Lock mylock(this);
|
2006-01-20 17:54:25 +00:00
|
|
|
ThreadedSourcePrivate* tmp = m_thread;
|
|
|
|
m_thread = 0;
|
2009-09-07 23:49:12 +00:00
|
|
|
if (!tmp || tmp->running())
|
|
|
|
return;
|
|
|
|
Debug(DebugInfo,"ThreadedSource deleting stopped thread %p [%p]",tmp,this);
|
|
|
|
mylock.drop();
|
|
|
|
delete tmp;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ThreadedSource::cleanup()
|
|
|
|
{
|
2009-09-07 23:49:12 +00:00
|
|
|
lock();
|
2007-06-08 18:33:33 +00:00
|
|
|
m_thread = 0;
|
2009-09-07 23:49:12 +00:00
|
|
|
unlock();
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
2005-03-20 03:11:53 +00:00
|
|
|
Thread* ThreadedSource::thread() const
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
|
|
|
return m_thread;
|
|
|
|
}
|
|
|
|
|
2007-01-12 22:16:38 +00:00
|
|
|
bool ThreadedSource::running() const
|
|
|
|
{
|
2009-09-07 23:49:12 +00:00
|
|
|
Lock mylock(const_cast<ThreadedSource*>(this));
|
2007-01-12 22:16:38 +00:00
|
|
|
return m_thread && m_thread->running();
|
|
|
|
}
|
|
|
|
|
2009-09-14 11:02:27 +00:00
|
|
|
bool ThreadedSource::looping(bool runConsumers) const
|
2009-09-07 23:49:12 +00:00
|
|
|
{
|
|
|
|
Lock mylock(const_cast<ThreadedSource*>(this));
|
2010-03-01 22:49:17 +00:00
|
|
|
if ((refcount() <= 1) && !(runConsumers && alive() && m_consumers.count()))
|
2009-09-14 11:02:27 +00:00
|
|
|
return false;
|
|
|
|
return m_thread && !m_thread->check(false) &&
|
2009-09-07 23:49:12 +00:00
|
|
|
m_thread->isCurrent() && !Engine::exiting();
|
|
|
|
}
|
|
|
|
|
2005-12-28 22:27:53 +00:00
|
|
|
|
2005-03-20 03:11:53 +00:00
|
|
|
DataTranslator::DataTranslator(const char* sFormat, const char* dFormat)
|
2005-02-06 20:13:21 +00:00
|
|
|
: DataConsumer(sFormat)
|
|
|
|
{
|
2005-09-28 17:41:31 +00:00
|
|
|
DDebug(DebugAll,"DataTranslator::DataTranslator('%s','%s') [%p]",sFormat,dFormat,this);
|
2005-02-06 20:13:21 +00:00
|
|
|
m_tsource = new DataSource(dFormat);
|
|
|
|
m_tsource->setTranslator(this);
|
|
|
|
}
|
|
|
|
|
2005-03-20 03:11:53 +00:00
|
|
|
DataTranslator::DataTranslator(const char* sFormat, DataSource* source)
|
2005-02-06 20:13:21 +00:00
|
|
|
: DataConsumer(sFormat), m_tsource(source)
|
|
|
|
{
|
2005-09-28 17:41:31 +00:00
|
|
|
DDebug(DebugAll,"DataTranslator::DataTranslator('%s',%p) [%p]",sFormat,source,this);
|
2005-02-06 20:13:21 +00:00
|
|
|
m_tsource->setTranslator(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
DataTranslator::~DataTranslator()
|
|
|
|
{
|
2005-09-28 17:41:31 +00:00
|
|
|
DDebug(DebugAll,"DataTranslator::~DataTranslator() [%p]",this);
|
2005-02-06 20:13:21 +00:00
|
|
|
DataSource *temp = m_tsource;
|
|
|
|
m_tsource = 0;
|
|
|
|
if (temp) {
|
|
|
|
temp->setTranslator(0);
|
|
|
|
temp->deref();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-04-14 03:14:20 +00:00
|
|
|
void* DataTranslator::getObject(const String& name) const
|
|
|
|
{
|
|
|
|
if (name == "DataTranslator")
|
|
|
|
return const_cast<DataTranslator*>(this);
|
|
|
|
return DataConsumer::getObject(name);
|
|
|
|
}
|
|
|
|
|
2006-05-25 20:40:58 +00:00
|
|
|
DataTranslator* DataTranslator::getFirstTranslator()
|
|
|
|
{
|
|
|
|
DataSource* tsource = getConnSource();
|
|
|
|
if (!tsource)
|
|
|
|
return this;
|
|
|
|
DataTranslator* trans = tsource->getTranslator();
|
|
|
|
return trans ? trans->getFirstTranslator() : this;
|
|
|
|
}
|
|
|
|
|
|
|
|
const DataTranslator* DataTranslator::getFirstTranslator() const
|
|
|
|
{
|
|
|
|
const DataSource* tsource = getConnSource();
|
|
|
|
if (!tsource)
|
|
|
|
return this;
|
|
|
|
const DataTranslator* trans = tsource->getTranslator();
|
|
|
|
return trans ? trans->getFirstTranslator() : this;
|
|
|
|
}
|
|
|
|
|
2006-06-28 17:39:15 +00:00
|
|
|
bool DataTranslator::synchronize(DataSource* source)
|
|
|
|
{
|
|
|
|
if (!DataConsumer::synchronize(source))
|
|
|
|
return false;
|
|
|
|
if (m_tsource)
|
|
|
|
m_tsource->synchronize(timeStamp());
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-05-05 12:25:31 +00:00
|
|
|
Mutex DataTranslator::s_mutex(true,"DataTranslator");
|
2005-02-06 20:13:21 +00:00
|
|
|
ObjList DataTranslator::s_factories;
|
2006-05-25 20:40:58 +00:00
|
|
|
unsigned int DataTranslator::s_maxChain = 3;
|
|
|
|
static ObjList s_compose;
|
2010-04-02 14:28:27 +00:00
|
|
|
static SimpleFactory s_sFactory(s_simpleCaps,"g711");
|
|
|
|
static SimpleFactory s_sFactory16k(s_simpleCaps16k,"g711wb");
|
|
|
|
static SimpleFactory s_sFactory32k(s_simpleCaps32k,"g711uwb");
|
2006-05-25 20:40:58 +00:00
|
|
|
// FIXME
|
|
|
|
static ResampFactory s_rFactory;
|
|
|
|
static StereoFactory s_stereoFactory;
|
|
|
|
|
|
|
|
void DataTranslator::setMaxChain(unsigned int maxChain)
|
|
|
|
{
|
|
|
|
if (maxChain < 1)
|
|
|
|
maxChain = 1;
|
|
|
|
if (maxChain > 4)
|
|
|
|
maxChain = 4;
|
|
|
|
s_maxChain = maxChain;
|
|
|
|
}
|
2005-02-06 20:13:21 +00:00
|
|
|
|
2005-03-20 03:11:53 +00:00
|
|
|
void DataTranslator::install(TranslatorFactory* factory)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2006-05-25 20:40:58 +00:00
|
|
|
if (!factory)
|
|
|
|
return;
|
|
|
|
Lock lock(s_mutex);
|
|
|
|
if (s_factories.find(factory))
|
|
|
|
return;
|
|
|
|
s_factories.append(factory)->setDelete(false);
|
|
|
|
s_compose.append(factory)->setDelete(false);
|
|
|
|
}
|
|
|
|
|
|
|
|
void DataTranslator::compose()
|
|
|
|
{
|
|
|
|
for (;;) {
|
|
|
|
TranslatorFactory* factory = static_cast<TranslatorFactory*>(s_compose.remove(false));
|
|
|
|
if (!factory)
|
|
|
|
break;
|
|
|
|
compose(factory);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void DataTranslator::compose(TranslatorFactory* factory)
|
|
|
|
{
|
|
|
|
const TranslatorCaps* caps = factory->getCapabilities();
|
2010-04-02 14:28:27 +00:00
|
|
|
XDebug(DebugInfo,"Composing TranslatorFactory '%s' (%u,'%s'->'%s'->'%s')",
|
|
|
|
factory->name(),factory->length(),caps ? caps->src->name : "",
|
|
|
|
factory->intermediate() ? factory->intermediate()->name : "",
|
|
|
|
caps ? caps->dest->name : "");
|
2006-05-25 20:40:58 +00:00
|
|
|
if ((!caps) || (factory->length() >= s_maxChain))
|
|
|
|
return;
|
|
|
|
Lock lock(s_mutex);
|
|
|
|
// now see if we can build some conversion chains with this factory
|
|
|
|
ListIterator iter(s_factories);
|
|
|
|
while (TranslatorFactory* f2 = static_cast<TranslatorFactory*>(iter.get())) {
|
|
|
|
// do not combine with itself
|
|
|
|
if (f2 == factory)
|
|
|
|
continue;
|
|
|
|
// don't try to build a too long chain
|
2010-04-02 14:28:27 +00:00
|
|
|
if ((factory->length() + f2->length()) > s_maxChain) {
|
|
|
|
XDebug(DebugAll,"Chain would be too long");
|
2006-05-25 20:40:58 +00:00
|
|
|
continue;
|
2010-04-02 14:28:27 +00:00
|
|
|
}
|
|
|
|
const FormatInfo* fi;
|
2006-05-25 20:40:58 +00:00
|
|
|
// and avoid loops
|
2010-04-02 14:28:27 +00:00
|
|
|
if (factory->intermediate(fi = f2->intermediate()) ||
|
|
|
|
f2->intermediate(fi = factory->intermediate())) {
|
|
|
|
XDebug(DebugAll,"Would directly loop through format '%s'",fi->name);
|
2006-05-25 20:40:58 +00:00
|
|
|
continue;
|
2010-04-02 14:28:27 +00:00
|
|
|
}
|
2006-05-25 20:40:58 +00:00
|
|
|
const TranslatorCaps* c2 = f2->getCapabilities();
|
2010-04-02 14:28:27 +00:00
|
|
|
XDebug(DebugInfo,"Composing '%s' with '%s' (%u,'%s'->'%s'->'%s')",
|
|
|
|
factory->name(),f2->name(),f2->length(),c2 ? c2->src->name : "",
|
|
|
|
f2->intermediate() ? f2->intermediate()->name : "",
|
|
|
|
c2 ? c2->dest->name : "");
|
2006-05-25 20:40:58 +00:00
|
|
|
for (; c2 && c2->src && c2->dest; c2++) {
|
2010-04-02 14:28:27 +00:00
|
|
|
if (!(c2->src->converter || c2->dest->converter))
|
|
|
|
continue;
|
|
|
|
if (factory->intermediate(fi = c2->src) || factory->intermediate(fi = c2->dest)) {
|
|
|
|
XDebug(DebugAll,"Factory '%s' already has intermediate '%s'",factory->name(),fi->name);
|
2006-05-25 20:40:58 +00:00
|
|
|
break;
|
2010-04-02 14:28:27 +00:00
|
|
|
}
|
2006-05-25 20:40:58 +00:00
|
|
|
for (const TranslatorCaps* c = caps; c->src && c->dest; c++) {
|
2010-04-02 14:28:27 +00:00
|
|
|
if (!(c->src->converter || c->dest->converter))
|
|
|
|
continue;
|
|
|
|
if (f2->intermediate(fi = c->src) || f2->intermediate(fi = c->dest)) {
|
|
|
|
XDebug(DebugAll,"Factory '%s' already has intermediate '%s'",f2->name(),fi->name);
|
2006-05-25 20:40:58 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
if ((c->src == c2->dest) && c->src->converter) {
|
2010-04-02 14:28:27 +00:00
|
|
|
if (canConvert(c2->src,c->dest)) {
|
|
|
|
XDebug(DebugAll,"Can already convert '%s' to '%s'",c2->src->name,c->dest->name);
|
2006-05-25 20:40:58 +00:00
|
|
|
continue;
|
2010-04-02 14:28:27 +00:00
|
|
|
}
|
|
|
|
DDebug(DebugInfo,"Building chain (%s)%s%s -> (%s) -> %s%s(%s)",
|
2006-05-25 20:40:58 +00:00
|
|
|
c2->src->name,
|
|
|
|
f2->intermediate() ? " -> " : "",
|
|
|
|
f2->intermediate() ? f2->intermediate()->name : "",
|
|
|
|
c->src->name,
|
|
|
|
factory->intermediate() ? factory->intermediate()->name : "",
|
|
|
|
factory->intermediate() ? " -> " : "",
|
|
|
|
c->dest->name);
|
|
|
|
new ChainedFactory(f2,factory,c->src);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if ((c2->src == c->dest) && c2->src->converter) {
|
2010-04-02 14:28:27 +00:00
|
|
|
if (canConvert(c->src,c2->dest)) {
|
|
|
|
XDebug(DebugAll,"Can already convert '%s' to '%s'",c->src->name,c2->dest->name);
|
2006-05-25 20:40:58 +00:00
|
|
|
continue;
|
2010-04-02 14:28:27 +00:00
|
|
|
}
|
|
|
|
DDebug(DebugInfo,"Building chain (%s)%s%s -> (%s) -> %s%s(%s)",
|
2006-05-25 20:40:58 +00:00
|
|
|
c->src->name,
|
|
|
|
factory->intermediate() ? " -> " : "",
|
|
|
|
factory->intermediate() ? factory->intermediate()->name : "",
|
|
|
|
c->dest->name,
|
|
|
|
f2->intermediate() ? f2->intermediate()->name : "",
|
|
|
|
f2->intermediate() ? " -> " : "",
|
|
|
|
c2->dest->name);
|
|
|
|
new ChainedFactory(factory,f2,c->dest);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
2005-03-20 03:11:53 +00:00
|
|
|
void DataTranslator::uninstall(TranslatorFactory* factory)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2006-05-25 20:40:58 +00:00
|
|
|
if (!factory)
|
|
|
|
return;
|
2005-02-06 20:13:21 +00:00
|
|
|
s_mutex.lock();
|
2006-05-25 20:40:58 +00:00
|
|
|
s_compose.remove(factory,false);
|
2005-02-06 20:13:21 +00:00
|
|
|
s_factories.remove(factory,false);
|
2006-05-25 20:40:58 +00:00
|
|
|
// notify chained factories about the removal
|
|
|
|
ListIterator iter(s_factories);
|
|
|
|
while (TranslatorFactory* f = static_cast<TranslatorFactory*>(iter.get()))
|
|
|
|
f->removed(factory);
|
2005-02-06 20:13:21 +00:00
|
|
|
s_mutex.unlock();
|
|
|
|
}
|
|
|
|
|
2006-05-25 20:40:58 +00:00
|
|
|
ObjList* DataTranslator::srcFormats(const DataFormat& dFormat, int maxCost, unsigned int maxLen, ObjList* lst)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2006-05-25 20:40:58 +00:00
|
|
|
const FormatInfo* fi = dFormat.getInfo();
|
|
|
|
if (!fi)
|
|
|
|
return lst;
|
2005-02-06 20:13:21 +00:00
|
|
|
s_mutex.lock();
|
2006-05-25 20:40:58 +00:00
|
|
|
compose();
|
|
|
|
ObjList* l = s_factories.skipNull();
|
2005-04-08 12:45:19 +00:00
|
|
|
for (; l; l=l->skipNext()) {
|
2006-05-25 20:40:58 +00:00
|
|
|
TranslatorFactory* f = static_cast<TranslatorFactory*>(l->get());
|
|
|
|
if (maxLen && (f->length() > maxLen))
|
|
|
|
continue;
|
|
|
|
const TranslatorCaps* caps = f->getCapabilities();
|
2005-04-08 12:45:19 +00:00
|
|
|
for (; caps && caps->src && caps->dest; caps++) {
|
2006-05-25 20:40:58 +00:00
|
|
|
if (caps->dest == fi) {
|
|
|
|
if ((maxCost >= 0) && (caps->cost > maxCost))
|
|
|
|
continue;
|
|
|
|
if (!lst)
|
|
|
|
lst = new ObjList;
|
|
|
|
else if (lst->find(caps->src->name))
|
|
|
|
continue;
|
|
|
|
lst->append(new String(caps->src->name));
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
s_mutex.unlock();
|
2006-05-25 20:40:58 +00:00
|
|
|
return lst;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
2006-05-25 20:40:58 +00:00
|
|
|
ObjList* DataTranslator::destFormats(const DataFormat& sFormat, int maxCost, unsigned int maxLen, ObjList* lst)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2006-05-25 20:40:58 +00:00
|
|
|
const FormatInfo* fi = sFormat.getInfo();
|
|
|
|
if (!fi)
|
|
|
|
return lst;
|
2005-02-06 20:13:21 +00:00
|
|
|
s_mutex.lock();
|
2006-05-25 20:40:58 +00:00
|
|
|
compose();
|
|
|
|
ObjList* l = s_factories.skipNull();
|
2005-04-08 12:45:19 +00:00
|
|
|
for (; l; l=l->skipNext()) {
|
2006-05-25 20:40:58 +00:00
|
|
|
TranslatorFactory* f = static_cast<TranslatorFactory*>(l->get());
|
|
|
|
if (maxLen && (f->length() > maxLen))
|
|
|
|
continue;
|
|
|
|
const TranslatorCaps* caps = f->getCapabilities();
|
2005-04-08 12:45:19 +00:00
|
|
|
for (; caps && caps->src && caps->dest; caps++) {
|
2006-05-25 20:40:58 +00:00
|
|
|
if (caps->src == fi) {
|
|
|
|
if ((maxCost >= 0) && (caps->cost > maxCost))
|
|
|
|
continue;
|
|
|
|
if (!lst)
|
|
|
|
lst = new ObjList;
|
|
|
|
else if (lst->find(caps->dest->name))
|
|
|
|
continue;
|
|
|
|
lst->append(new String(caps->dest->name));
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
s_mutex.unlock();
|
2006-05-25 20:40:58 +00:00
|
|
|
return lst;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
|
2007-03-26 17:20:34 +00:00
|
|
|
// helper function to avoid duplicating large amounts of code
|
|
|
|
static void mergeOne(ObjList*& lst, const ObjList* formats, const DataFormat& fmt, const FormatInfo* fi, bool sameRate, bool sameChans)
|
|
|
|
{
|
|
|
|
if (!fi)
|
|
|
|
return;
|
|
|
|
const DataFormat fmti(fi);
|
|
|
|
if (lst && lst->find(fmti))
|
|
|
|
return;
|
|
|
|
if (formats->find(fmti))
|
|
|
|
return;
|
|
|
|
const FormatInfo* fo = fmt.getInfo();
|
|
|
|
if (fo == fi)
|
|
|
|
return;
|
|
|
|
if (sameRate && (fo->sampleRate != fi->sampleRate))
|
|
|
|
return;
|
|
|
|
if (sameChans && (fo->numChannels != fi->numChannels))
|
|
|
|
return;
|
|
|
|
if (DataTranslator::canConvert(fmt,fmti)) {
|
|
|
|
if (!lst)
|
|
|
|
lst = new ObjList;
|
|
|
|
lst->append(new String(fmti));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ObjList* DataTranslator::allFormats(const ObjList* formats, bool existing, bool sameRate, bool sameChans)
|
|
|
|
{
|
|
|
|
if (!formats)
|
|
|
|
return 0;
|
|
|
|
ObjList* lst = 0;
|
|
|
|
s_mutex.lock();
|
|
|
|
compose();
|
|
|
|
const ObjList* fmts;
|
|
|
|
if (existing) {
|
|
|
|
// put existing formats first
|
|
|
|
for (fmts = formats; fmts; fmts = fmts->next()) {
|
|
|
|
const String* fmt = static_cast<const String*>(fmts->get());
|
|
|
|
if (!(fmt && *fmt))
|
|
|
|
continue;
|
|
|
|
const FormatInfo* fo = FormatRepository::getFormat(*fmt);
|
|
|
|
if (fo) {
|
|
|
|
if (!lst)
|
|
|
|
lst = new ObjList;
|
|
|
|
lst->append(new String(fo->name));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for (fmts = formats; fmts; fmts = fmts->next()) {
|
|
|
|
const String* fmt = static_cast<const String*>(fmts->get());
|
|
|
|
if (!(fmt && *fmt))
|
|
|
|
continue;
|
|
|
|
const FormatInfo* fo = FormatRepository::getFormat(*fmt);
|
|
|
|
if (!fo)
|
|
|
|
continue;
|
|
|
|
const DataFormat fmto(fo);
|
|
|
|
|
|
|
|
// search in the static list first
|
|
|
|
for (unsigned int i = 0; i < (sizeof(s_formats)/sizeof(FormatInfo)); i++)
|
|
|
|
mergeOne(lst,formats,fmto,s_formats+i,sameRate,sameChans);
|
|
|
|
// then try the installed formats
|
|
|
|
for (flist* l = s_flist; l; l = l->next)
|
|
|
|
mergeOne(lst,formats,fmto,l->info,sameRate,sameChans);
|
|
|
|
}
|
|
|
|
s_mutex.unlock();
|
|
|
|
return lst;
|
|
|
|
}
|
|
|
|
|
|
|
|
ObjList* DataTranslator::allFormats(const String& formats, bool existing, bool sameRate, bool sameChans)
|
|
|
|
{
|
|
|
|
ObjList* fmts = formats.split(',',false);
|
|
|
|
if (!fmts)
|
|
|
|
return 0;
|
|
|
|
ObjList* lst = allFormats(fmts,existing,sameRate,sameChans);
|
2007-05-15 15:40:50 +00:00
|
|
|
TelEngine::destruct(fmts);
|
2007-03-26 17:20:34 +00:00
|
|
|
return lst;
|
|
|
|
}
|
|
|
|
|
2005-05-31 19:42:44 +00:00
|
|
|
bool DataTranslator::canConvert(const DataFormat& fmt1, const DataFormat& fmt2)
|
|
|
|
{
|
|
|
|
if (fmt1 == fmt2)
|
|
|
|
return true;
|
2006-05-25 20:40:58 +00:00
|
|
|
const FormatInfo* fi1 = fmt1.getInfo();
|
|
|
|
const FormatInfo* fi2 = fmt2.getInfo();
|
|
|
|
if (!(fi1 && fi2))
|
|
|
|
return false;
|
|
|
|
Lock lock(s_mutex);
|
|
|
|
compose();
|
|
|
|
return canConvert(fi1,fi2);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool DataTranslator::canConvert(const FormatInfo* fmt1, const FormatInfo* fmt2)
|
|
|
|
{
|
|
|
|
if (fmt1 == fmt2)
|
2005-05-31 19:42:44 +00:00
|
|
|
return true;
|
|
|
|
bool ok1 = false, ok2 = false;
|
2006-05-25 20:40:58 +00:00
|
|
|
ObjList* l = s_factories.skipNull();
|
2005-05-31 19:42:44 +00:00
|
|
|
for (; l; l=l->skipNext()) {
|
2006-05-25 20:40:58 +00:00
|
|
|
TranslatorFactory* f = static_cast<TranslatorFactory*>(l->get());
|
|
|
|
const TranslatorCaps* caps = f->getCapabilities();
|
2005-05-31 19:42:44 +00:00
|
|
|
for (; caps && caps->src && caps->dest; caps++) {
|
2006-05-25 20:40:58 +00:00
|
|
|
if ((!ok1) && (caps->src == fmt1) && (caps->dest == fmt2))
|
2005-05-31 19:42:44 +00:00
|
|
|
ok1 = true;
|
2006-05-25 20:40:58 +00:00
|
|
|
if ((!ok2) && (caps->src == fmt2) && (caps->dest == fmt1))
|
2005-05-31 19:42:44 +00:00
|
|
|
ok2 = true;
|
|
|
|
if (ok1 && ok2)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2005-04-11 00:56:55 +00:00
|
|
|
int DataTranslator::cost(const DataFormat& sFormat, const DataFormat& dFormat)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
|
|
|
int c = -1;
|
2006-05-25 20:40:58 +00:00
|
|
|
const FormatInfo* src = sFormat.getInfo();
|
|
|
|
const FormatInfo* dest = dFormat.getInfo();
|
|
|
|
if (!(src && dest))
|
|
|
|
return c;
|
2005-02-06 20:13:21 +00:00
|
|
|
s_mutex.lock();
|
2006-05-25 20:40:58 +00:00
|
|
|
compose();
|
|
|
|
ObjList* l = s_factories.skipNull();
|
2005-04-08 12:45:19 +00:00
|
|
|
for (; l; l=l->skipNext()) {
|
2006-05-25 20:40:58 +00:00
|
|
|
TranslatorFactory* f = static_cast<TranslatorFactory*>(l->get());
|
|
|
|
const TranslatorCaps* caps = f->getCapabilities();
|
2005-04-08 12:45:19 +00:00
|
|
|
for (; caps && caps->src && caps->dest; caps++) {
|
|
|
|
if ((c == -1) || (c > caps->cost)) {
|
2006-05-25 20:40:58 +00:00
|
|
|
if ((caps->src == src) && (caps->dest == dest))
|
2005-04-08 12:45:19 +00:00
|
|
|
c = caps->cost;
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
s_mutex.unlock();
|
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
2005-04-11 00:56:55 +00:00
|
|
|
DataTranslator* DataTranslator::create(const DataFormat& sFormat, const DataFormat& dFormat)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
|
|
|
if (sFormat == dFormat) {
|
2006-02-23 13:46:20 +00:00
|
|
|
DDebug(DebugAll,"Not creating identity DataTranslator for '%s'",sFormat.c_str());
|
2005-02-06 20:13:21 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
DataTranslator *trans = 0;
|
|
|
|
|
|
|
|
s_mutex.lock();
|
2006-05-25 20:40:58 +00:00
|
|
|
compose();
|
2005-04-08 12:45:19 +00:00
|
|
|
ObjList *l = s_factories.skipNull();
|
|
|
|
for (; l; l=l->skipNext()) {
|
2006-05-25 20:40:58 +00:00
|
|
|
TranslatorFactory* f = static_cast<TranslatorFactory*>(l->get());
|
2005-04-08 12:45:19 +00:00
|
|
|
trans = f->create(sFormat,dFormat);
|
2006-05-25 20:40:58 +00:00
|
|
|
if (trans) {
|
|
|
|
Debug(DebugAll,"Created DataTranslator %p for '%s' -> '%s' by factory %p (len=%u)",
|
|
|
|
trans,sFormat.c_str(),dFormat.c_str(),f,f->length());
|
2005-04-08 12:45:19 +00:00
|
|
|
break;
|
2006-05-25 20:40:58 +00:00
|
|
|
}
|
2005-02-06 20:13:21 +00:00
|
|
|
}
|
|
|
|
s_mutex.unlock();
|
|
|
|
|
2006-05-25 20:40:58 +00:00
|
|
|
if (!trans)
|
2006-02-23 13:46:20 +00:00
|
|
|
Debug(DebugInfo,"No DataTranslator created for '%s' -> '%s'",
|
2005-02-06 20:13:21 +00:00
|
|
|
sFormat.c_str(),dFormat.c_str());
|
|
|
|
return trans;
|
|
|
|
}
|
|
|
|
|
2005-09-28 17:41:31 +00:00
|
|
|
bool DataTranslator::attachChain(DataSource* source, DataConsumer* consumer, bool override)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
2006-02-23 13:46:20 +00:00
|
|
|
XDebug(DebugInfo,"DataTranslator::attachChain [%p] '%s' -> [%p] '%s'",
|
2008-01-04 18:37:28 +00:00
|
|
|
source,(source ? source->getFormat().c_str() : ""),
|
|
|
|
consumer,(consumer ? consumer->getFormat().c_str() : ""));
|
2008-01-04 18:05:59 +00:00
|
|
|
if (!source || !consumer)
|
2005-02-06 20:13:21 +00:00
|
|
|
return false;
|
2008-01-04 18:05:59 +00:00
|
|
|
if (!source->getFormat() || !consumer->getFormat()) {
|
|
|
|
Debug(DebugInfo,"DataTranslator::attachChain [%p] '%s' -> [%p] '%s' not possible",
|
2008-01-04 18:35:07 +00:00
|
|
|
source,source->getFormat().c_str(),
|
|
|
|
consumer,consumer->getFormat().c_str());
|
2008-01-04 18:05:59 +00:00
|
|
|
return false;
|
|
|
|
}
|
2005-02-06 20:13:21 +00:00
|
|
|
|
|
|
|
bool retv = false;
|
|
|
|
// first attempt to connect directly, changing format if possible
|
|
|
|
if ((source->getFormat() == consumer->getFormat()) ||
|
2005-09-28 17:41:31 +00:00
|
|
|
// don't attempt to change consumer format for overrides
|
|
|
|
(!override && consumer->setFormat(source->getFormat())) ||
|
2005-02-06 20:13:21 +00:00
|
|
|
source->setFormat(consumer->getFormat())) {
|
2005-09-28 17:41:31 +00:00
|
|
|
source->attach(consumer,override);
|
2005-02-06 20:13:21 +00:00
|
|
|
retv = true;
|
|
|
|
}
|
|
|
|
else {
|
2006-05-25 20:40:58 +00:00
|
|
|
// then try to create a translator or chain of them
|
|
|
|
DataTranslator* trans2 = create(source->getFormat(),consumer->getFormat());
|
|
|
|
if (trans2) {
|
|
|
|
DataTranslator* trans = trans2->getFirstTranslator();
|
|
|
|
trans2->getTransSource()->attach(consumer,override);
|
2005-02-06 20:13:21 +00:00
|
|
|
source->attach(trans);
|
2005-09-28 17:41:31 +00:00
|
|
|
trans->deref();
|
2005-02-06 20:13:21 +00:00
|
|
|
retv = true;
|
|
|
|
}
|
|
|
|
}
|
2006-02-23 13:46:20 +00:00
|
|
|
NDebug(retv ? DebugAll : DebugWarn,"DataTranslator::attachChain [%p] '%s' -> [%p] '%s' %s",
|
2005-04-11 00:59:13 +00:00
|
|
|
source,source->getFormat().c_str(),consumer,consumer->getFormat().c_str(),
|
2005-02-06 20:13:21 +00:00
|
|
|
retv ? "succeeded" : "failed");
|
|
|
|
return retv;
|
|
|
|
}
|
|
|
|
|
2005-03-20 03:11:53 +00:00
|
|
|
bool DataTranslator::detachChain(DataSource* source, DataConsumer* consumer)
|
2005-02-06 20:13:21 +00:00
|
|
|
{
|
|
|
|
Debugger debug(DebugAll,"DataTranslator::detachChain","(%p,%p)",source,consumer);
|
|
|
|
if (!source || !consumer)
|
|
|
|
return false;
|
|
|
|
|
2010-10-27 16:03:44 +00:00
|
|
|
s_consSrcMutex.lock();
|
2010-09-23 14:37:48 +00:00
|
|
|
RefPointer<DataSource> tsource = consumer->getConnSource();
|
2010-10-27 16:03:44 +00:00
|
|
|
s_consSrcMutex.unlock();
|
2005-02-06 20:13:21 +00:00
|
|
|
if (tsource) {
|
|
|
|
if (source->detach(consumer))
|
|
|
|
return true;
|
2010-10-29 08:41:32 +00:00
|
|
|
tsource->lock();
|
|
|
|
RefPointer<DataTranslator> trans = tsource->getTranslator();
|
|
|
|
tsource->unlock();
|
2005-09-28 17:41:31 +00:00
|
|
|
if (trans && detachChain(source,trans))
|
2005-02-06 20:13:21 +00:00
|
|
|
return true;
|
|
|
|
Debug(DebugWarn,"DataTranslator failed to detach chain [%p] -> [%p]",source,consumer);
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
2005-03-28 00:58:26 +00:00
|
|
|
|
2006-05-25 20:40:58 +00:00
|
|
|
|
|
|
|
TranslatorFactory::~TranslatorFactory()
|
|
|
|
{
|
|
|
|
DataTranslator::uninstall(this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void TranslatorFactory::removed(const TranslatorFactory* factory)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned int TranslatorFactory::length() const
|
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
const FormatInfo* TranslatorFactory::intermediate() const
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool TranslatorFactory::intermediate(const FormatInfo* info) const
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool TranslatorFactory::converts(const DataFormat& sFormat, const DataFormat& dFormat) const
|
|
|
|
{
|
|
|
|
const FormatInfo* src = sFormat.getInfo();
|
|
|
|
const FormatInfo* dest = dFormat.getInfo();
|
|
|
|
const TranslatorCaps* caps = getCapabilities();
|
|
|
|
if (!(src && dest && caps))
|
|
|
|
return false;
|
|
|
|
for (; caps->src && caps->dest; caps++) {
|
|
|
|
if ((caps->src == src) && (caps->dest == dest))
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
ChainedFactory::ChainedFactory(TranslatorFactory* factory1, TranslatorFactory* factory2, const FormatInfo* info)
|
2010-04-02 14:28:27 +00:00
|
|
|
: TranslatorFactory("chained"),
|
|
|
|
m_factory1(factory1), m_factory2(factory2), m_format(info),
|
2006-05-25 20:40:58 +00:00
|
|
|
m_length(factory1->length()+factory2->length()), m_capabilities(0)
|
|
|
|
{
|
2010-04-02 14:28:27 +00:00
|
|
|
XDebug(DebugInfo,"ChainedFactory::ChainedFactory('%s' (%d,'%s'), '%s' (%d,'%s'),'%s') len=%u [%p]",
|
|
|
|
factory1->name(),factory1->length(),factory1->intermediate() ? factory1->intermediate()->name : "",
|
|
|
|
factory2->name(),factory2->length(),factory2->intermediate() ? factory2->intermediate()->name : "",
|
2006-05-25 20:40:58 +00:00
|
|
|
info->name,m_length,this);
|
2010-04-02 14:28:27 +00:00
|
|
|
m_name << factory1->name() << "(" << info->name << ")" << factory2->name();
|
2006-05-25 20:40:58 +00:00
|
|
|
if (!info->converter)
|
2010-04-02 14:28:27 +00:00
|
|
|
Debug(DebugMild,"Building chain factory '%s' using non-converter format",m_name.c_str());
|
2006-05-25 20:40:58 +00:00
|
|
|
const TranslatorCaps* cap1 = factory1->getCapabilities();
|
|
|
|
const TranslatorCaps* cap2 = factory2->getCapabilities();
|
|
|
|
int c1 = 0;
|
|
|
|
int c2 = 0;
|
|
|
|
const TranslatorCaps* c;
|
|
|
|
for (c = cap1; c && c->src && c->dest; c++)
|
|
|
|
if ((c->src == info) || (c->dest == info))
|
|
|
|
c1++;
|
|
|
|
for (c = cap2; c && c->src && c->dest; c++)
|
|
|
|
if ((c->src == info) || (c->dest == info))
|
|
|
|
c2++;
|
|
|
|
// we overallocate
|
|
|
|
int ccount = c1 * c2;
|
|
|
|
int i = 0;
|
|
|
|
TranslatorCaps* caps = new TranslatorCaps[ccount+1];
|
|
|
|
for (; cap1 && cap1->src && cap1->dest; cap1++) {
|
|
|
|
if (cap1->src == info) {
|
|
|
|
for (c = cap2; c && c->src && c->dest; c++)
|
|
|
|
if (c->dest == info) {
|
|
|
|
caps[i].src = c->src;
|
|
|
|
caps[i].dest = cap1->dest;
|
|
|
|
caps[i].cost = cap1->cost + c->cost;
|
|
|
|
XDebug(DebugAll,"Capab[%d] '%s' -> '%s' cost %d",
|
|
|
|
i,caps[i].src->name,caps[i].dest->name,caps[i].cost);
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (cap1->dest == info) {
|
|
|
|
for (c = cap2; c && c->src && c->dest; c++)
|
|
|
|
if (c->src == info) {
|
|
|
|
caps[i].src = cap1->src;
|
|
|
|
caps[i].dest = c->dest;
|
|
|
|
caps[i].cost = cap1->cost + c->cost;
|
|
|
|
XDebug(DebugAll,"Capab[%d] '%s' -> '%s' cost %d",
|
|
|
|
i,caps[i].src->name,caps[i].dest->name,caps[i].cost);
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
caps[i].src = 0;
|
|
|
|
caps[i].dest = 0;
|
|
|
|
caps[i].cost = 0;
|
|
|
|
m_capabilities = caps;
|
|
|
|
}
|
|
|
|
|
|
|
|
ChainedFactory::~ChainedFactory()
|
|
|
|
{
|
2010-04-02 14:28:27 +00:00
|
|
|
XDebug(DebugInfo,"ChainedFactory::~ChainedFactory() '%s' [%p]",
|
|
|
|
m_name.c_str(),this);
|
2006-05-26 08:16:45 +00:00
|
|
|
delete[] const_cast<TranslatorCaps*>(m_capabilities);
|
2006-05-25 20:40:58 +00:00
|
|
|
m_capabilities = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ChainedFactory::removed(const TranslatorFactory* factory)
|
|
|
|
{
|
|
|
|
if ((factory == m_factory1) || (factory == m_factory2))
|
|
|
|
destruct();
|
|
|
|
}
|
|
|
|
|
|
|
|
const FormatInfo* ChainedFactory::intermediate() const
|
|
|
|
{
|
|
|
|
return m_format.getInfo();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ChainedFactory::intermediate(const FormatInfo* info) const
|
|
|
|
{
|
|
|
|
if (!info)
|
|
|
|
return false;
|
|
|
|
return (m_format.getInfo() == info) ||
|
|
|
|
m_factory1->intermediate(info) ||
|
|
|
|
m_factory2->intermediate(info);
|
|
|
|
}
|
|
|
|
|
|
|
|
DataTranslator* ChainedFactory::create(const DataFormat& sFormat, const DataFormat& dFormat)
|
|
|
|
{
|
|
|
|
if (!converts(sFormat,dFormat))
|
|
|
|
return 0;
|
|
|
|
DataTranslator* trans = m_factory1->create(sFormat,m_format);
|
|
|
|
DataTranslator* trans2 = 0;
|
|
|
|
if (trans)
|
|
|
|
trans2 = m_factory2->create(m_format,dFormat);
|
|
|
|
else {
|
|
|
|
// try the other way around
|
|
|
|
trans = m_factory2->create(sFormat,m_format);
|
|
|
|
if (!trans)
|
|
|
|
return 0;
|
|
|
|
trans2 = m_factory1->create(m_format,dFormat);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (trans2) {
|
|
|
|
XDebug(DebugInfo,"Chaining translators: '%s' %p --(%s)-> %p '%s' [%p]",
|
|
|
|
sFormat.c_str(),trans,m_format.c_str(),trans2,dFormat.c_str(),this);
|
2006-11-24 15:03:55 +00:00
|
|
|
// trans2 may be a chain itself so find the first translator
|
|
|
|
DataTranslator* trans1 = trans2->getFirstTranslator();
|
|
|
|
trans->getTransSource()->attach(trans1);
|
|
|
|
trans1->deref();
|
2006-05-25 20:40:58 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
trans->destruct();
|
|
|
|
return trans2;
|
|
|
|
}
|
|
|
|
|
2005-03-28 00:58:26 +00:00
|
|
|
/* vi: set ts=8 sw=4 sts=4 noet: */
|