2005-09-14 20:46:50 +00:00
|
|
|
/*
|
|
|
|
* Asterisk -- An open source telephony toolkit.
|
|
|
|
*
|
2006-07-12 22:42:13 +00:00
|
|
|
* Copyright (C) 1999 - 2006, Digium, Inc.
|
2005-09-14 20:46:50 +00:00
|
|
|
*
|
|
|
|
* Mark Spencer <markster@digium.com>
|
2006-07-12 22:42:13 +00:00
|
|
|
* Kevin P. Fleming <kpfleming@digium.com>
|
2004-02-25 04:10:32 +00:00
|
|
|
*
|
|
|
|
* Based on frompcm.c and topcm.c from the Emiliano MIPL browser/
|
|
|
|
* interpreter. See http://www.bsdtelephony.com.mx
|
|
|
|
*
|
2005-09-14 20:46:50 +00:00
|
|
|
* See http://www.asterisk.org for more information about
|
|
|
|
* the Asterisk project. Please do not directly contact
|
|
|
|
* any of the maintainers of this project for assistance;
|
|
|
|
* the project provides a web site, mailing lists and IRC
|
|
|
|
* channels for your use.
|
2004-02-25 04:10:32 +00:00
|
|
|
*
|
|
|
|
* This program is free software, distributed under the terms of
|
2005-09-14 20:46:50 +00:00
|
|
|
* the GNU General Public License Version 2. See the LICENSE file
|
|
|
|
* at the top of the source tree.
|
|
|
|
*/
|
|
|
|
|
2005-10-26 13:03:17 +00:00
|
|
|
/*! \file
|
2005-09-14 20:46:50 +00:00
|
|
|
*
|
2006-07-12 22:42:13 +00:00
|
|
|
* \brief codec_g726.c - translate between signed linear and ITU G.726-32kbps (both RFC3551 and AAL2 codeword packing)
|
2005-09-14 20:46:50 +00:00
|
|
|
*
|
2005-11-06 15:09:47 +00:00
|
|
|
* \ingroup codecs
|
2004-02-25 04:10:32 +00:00
|
|
|
*/
|
|
|
|
|
2011-07-14 20:28:54 +00:00
|
|
|
/*** MODULEINFO
|
|
|
|
<support_level>core</support_level>
|
|
|
|
***/
|
|
|
|
|
2006-06-07 18:54:56 +00:00
|
|
|
#include "asterisk.h"
|
|
|
|
|
|
|
|
ASTERISK_FILE_VERSION(__FILE__, "$Revision$")
|
|
|
|
|
2005-04-21 06:02:45 +00:00
|
|
|
#include "asterisk/lock.h"
|
2006-04-08 21:40:57 +00:00
|
|
|
#include "asterisk/linkedlists.h"
|
2005-04-21 06:02:45 +00:00
|
|
|
#include "asterisk/module.h"
|
|
|
|
#include "asterisk/config.h"
|
|
|
|
#include "asterisk/translate.h"
|
2006-01-21 08:45:39 +00:00
|
|
|
#include "asterisk/utils.h"
|
2004-02-25 04:10:32 +00:00
|
|
|
|
2004-11-15 00:56:53 +00:00
|
|
|
#define WANT_ASM
|
|
|
|
#include "log2comp.h"
|
|
|
|
|
|
|
|
/* define NOT_BLI to use a faster but not bit-level identical version */
|
|
|
|
/* #define NOT_BLI */
|
|
|
|
|
|
|
|
#if defined(NOT_BLI)
|
|
|
|
# if defined(_MSC_VER)
|
|
|
|
typedef __int64 sint64;
|
|
|
|
# elif defined(__GNUC__)
|
|
|
|
typedef long long sint64;
|
|
|
|
# else
|
|
|
|
# error 64-bit integer type is not defined for your compiler/platform
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
2006-04-08 21:40:57 +00:00
|
|
|
#define BUFFER_SAMPLES 8096 /* size for the translation buffers */
|
2004-02-25 04:10:32 +00:00
|
|
|
#define BUF_SHIFT 5
|
|
|
|
|
|
|
|
/* Sample frame data */
|
2008-10-17 21:35:23 +00:00
|
|
|
#include "asterisk/slin.h"
|
|
|
|
#include "ex_g726.h"
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* The following is the definition of the state structure
|
2006-07-12 22:42:13 +00:00
|
|
|
* used by the G.726 encoder and decoder to preserve their internal
|
2004-02-25 04:10:32 +00:00
|
|
|
* state between successive calls. The meanings of the majority
|
|
|
|
* of the state structure fields are explained in detail in the
|
2006-07-12 22:42:13 +00:00
|
|
|
* CCITT Recommendation G.721. The field names are essentially identical
|
2004-02-25 04:10:32 +00:00
|
|
|
* to variable names in the bit level description of the coding algorithm
|
|
|
|
* included in this Recommendation.
|
|
|
|
*/
|
|
|
|
struct g726_state {
|
|
|
|
long yl; /* Locked or steady state step size multiplier. */
|
2004-11-15 00:56:53 +00:00
|
|
|
int yu; /* Unlocked or non-steady state step size multiplier. */
|
|
|
|
int dms; /* Short term energy estimate. */
|
|
|
|
int dml; /* Long term energy estimate. */
|
|
|
|
int ap; /* Linear weighting coefficient of 'yl' and 'yu'. */
|
|
|
|
int a[2]; /* Coefficients of pole portion of prediction filter.
|
2006-07-12 22:42:13 +00:00
|
|
|
* stored as fixed-point 1==2^14 */
|
2004-11-15 00:56:53 +00:00
|
|
|
int b[6]; /* Coefficients of zero portion of prediction filter.
|
2006-07-12 22:42:13 +00:00
|
|
|
* stored as fixed-point 1==2^14 */
|
2004-11-15 00:56:53 +00:00
|
|
|
int pk[2]; /* Signs of previous two samples of a partially
|
2006-07-12 22:42:13 +00:00
|
|
|
* reconstructed signal. */
|
|
|
|
int dq[6]; /* Previous 6 samples of the quantized difference signal
|
|
|
|
* stored as fixed point 1==2^12,
|
|
|
|
* or in internal floating point format */
|
2004-11-15 00:56:53 +00:00
|
|
|
int sr[2]; /* Previous 2 samples of the quantized difference signal
|
2006-07-12 22:42:13 +00:00
|
|
|
* stored as fixed point 1==2^12,
|
|
|
|
* or in internal floating point format */
|
|
|
|
int td; /* delayed tone detect, new in 1988 version */
|
2004-02-25 04:10:32 +00:00
|
|
|
};
|
|
|
|
|
2004-11-15 00:56:53 +00:00
|
|
|
static int qtab_721[7] = {-124, 80, 178, 246, 300, 349, 400};
|
2004-02-25 04:10:32 +00:00
|
|
|
/*
|
|
|
|
* Maps G.721 code word to reconstructed scale factor normalized log
|
|
|
|
* magnitude values.
|
|
|
|
*/
|
2004-11-15 00:56:53 +00:00
|
|
|
static int _dqlntab[16] = {-2048, 4, 135, 213, 273, 323, 373, 425,
|
2004-02-25 04:10:32 +00:00
|
|
|
425, 373, 323, 273, 213, 135, 4, -2048};
|
|
|
|
|
|
|
|
/* Maps G.721 code word to log of scale factor multiplier. */
|
2004-11-15 00:56:53 +00:00
|
|
|
static int _witab[16] = {-12, 18, 41, 64, 112, 198, 355, 1122,
|
2004-02-25 04:10:32 +00:00
|
|
|
1122, 355, 198, 112, 64, 41, 18, -12};
|
|
|
|
/*
|
|
|
|
* Maps G.721 code words to a set of values whose long and short
|
|
|
|
* term averages are computed and then compared to give an indication
|
|
|
|
* how stationary (steady state) the signal is.
|
|
|
|
*/
|
2004-11-15 00:56:53 +00:00
|
|
|
static int _fitab[16] = {0, 0, 0, 0x200, 0x200, 0x200, 0x600, 0xE00,
|
2004-02-25 04:10:32 +00:00
|
|
|
0xE00, 0x600, 0x200, 0x200, 0x200, 0, 0, 0};
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* g72x_init_state()
|
|
|
|
*
|
|
|
|
* This routine initializes and/or resets the g726_state structure
|
|
|
|
* pointed to by 'state_ptr'.
|
|
|
|
* All the initial state values are specified in the CCITT G.721 document.
|
|
|
|
*/
|
|
|
|
static void g726_init_state(struct g726_state *state_ptr)
|
|
|
|
{
|
|
|
|
int cnta;
|
|
|
|
|
|
|
|
state_ptr->yl = 34816;
|
|
|
|
state_ptr->yu = 544;
|
|
|
|
state_ptr->dms = 0;
|
|
|
|
state_ptr->dml = 0;
|
|
|
|
state_ptr->ap = 0;
|
2006-04-08 21:40:57 +00:00
|
|
|
for (cnta = 0; cnta < 2; cnta++) {
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->a[cnta] = 0;
|
|
|
|
state_ptr->pk[cnta] = 0;
|
2004-11-15 00:56:53 +00:00
|
|
|
#ifdef NOT_BLI
|
|
|
|
state_ptr->sr[cnta] = 1;
|
|
|
|
#else
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->sr[cnta] = 32;
|
2004-11-15 00:56:53 +00:00
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
2006-04-08 21:40:57 +00:00
|
|
|
for (cnta = 0; cnta < 6; cnta++) {
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->b[cnta] = 0;
|
2004-11-15 00:56:53 +00:00
|
|
|
#ifdef NOT_BLI
|
|
|
|
state_ptr->dq[cnta] = 1;
|
|
|
|
#else
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->dq[cnta] = 32;
|
2004-11-15 00:56:53 +00:00
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
state_ptr->td = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2004-11-15 00:56:53 +00:00
|
|
|
* quan()
|
2004-02-25 04:10:32 +00:00
|
|
|
*
|
2004-11-15 00:56:53 +00:00
|
|
|
* quantizes the input val against the table of integers.
|
|
|
|
* It returns i if table[i - 1] <= val < table[i].
|
2004-02-25 04:10:32 +00:00
|
|
|
*
|
2004-11-15 00:56:53 +00:00
|
|
|
* Using linear search for simple coding.
|
2004-02-25 04:10:32 +00:00
|
|
|
*/
|
2004-11-15 00:56:53 +00:00
|
|
|
static int quan(int val, int *table, int size)
|
2004-02-25 04:10:32 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
2004-11-15 00:56:53 +00:00
|
|
|
for (i = 0; i < size && val >= *table; ++i, ++table)
|
|
|
|
;
|
2012-04-17 18:57:40 +00:00
|
|
|
return i;
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
2004-11-15 00:56:53 +00:00
|
|
|
|
|
|
|
#ifdef NOT_BLI /* faster non-identical version */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* predictor_zero()
|
|
|
|
*
|
|
|
|
* computes the estimated signal from 6-zero predictor.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
static int predictor_zero(struct g726_state *state_ptr)
|
|
|
|
{ /* divide by 2 is necessary here to handle negative numbers correctly */
|
|
|
|
int i;
|
|
|
|
sint64 sezi;
|
|
|
|
for (sezi = 0, i = 0; i < 6; i++) /* ACCUM */
|
|
|
|
sezi += (sint64)state_ptr->b[i] * state_ptr->dq[i];
|
|
|
|
return (int)(sezi >> 13) / 2 /* 2^14 */;
|
|
|
|
}
|
|
|
|
|
2004-02-25 04:10:32 +00:00
|
|
|
/*
|
|
|
|
* predictor_pole()
|
|
|
|
*
|
|
|
|
* computes the estimated signal from 2-pole predictor.
|
|
|
|
*
|
|
|
|
*/
|
2004-11-15 00:56:53 +00:00
|
|
|
static int predictor_pole(struct g726_state *state_ptr)
|
|
|
|
{ /* divide by 2 is necessary here to handle negative numbers correctly */
|
|
|
|
return (int)(((sint64)state_ptr->a[1] * state_ptr->sr[1] +
|
|
|
|
(sint64)state_ptr->a[0] * state_ptr->sr[0]) >> 13) / 2 /* 2^14 */;
|
|
|
|
}
|
|
|
|
|
|
|
|
#else /* NOT_BLI - identical version */
|
|
|
|
/*
|
|
|
|
* fmult()
|
|
|
|
*
|
|
|
|
* returns the integer product of the fixed-point number "an" (1==2^12) and
|
|
|
|
* "floating point" representation (4-bit exponent, 6-bit mantessa) "srn".
|
|
|
|
*/
|
|
|
|
static int fmult(int an, int srn)
|
|
|
|
{
|
|
|
|
int anmag, anexp, anmant;
|
|
|
|
int wanexp, wanmant;
|
|
|
|
int retval;
|
|
|
|
|
|
|
|
anmag = (an > 0) ? an : ((-an) & 0x1FFF);
|
2005-05-15 03:18:16 +00:00
|
|
|
anexp = ilog2(anmag) - 5;
|
2004-11-15 00:56:53 +00:00
|
|
|
anmant = (anmag == 0) ? 32 :
|
|
|
|
(anexp >= 0) ? anmag >> anexp : anmag << -anexp;
|
|
|
|
wanexp = anexp + ((srn >> 6) & 0xF) - 13;
|
|
|
|
|
|
|
|
wanmant = (anmant * (srn & 077) + 0x30) >> 4;
|
|
|
|
retval = (wanexp >= 0) ? ((wanmant << wanexp) & 0x7FFF) :
|
|
|
|
(wanmant >> -wanexp);
|
|
|
|
|
|
|
|
return (((an ^ srn) < 0) ? -retval : retval);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int predictor_zero(struct g726_state *state_ptr)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int sezi;
|
|
|
|
for (sezi = 0, i = 0; i < 6; i++) /* ACCUM */
|
|
|
|
sezi += fmult(state_ptr->b[i] >> 2, state_ptr->dq[i]);
|
|
|
|
return sezi;
|
|
|
|
}
|
|
|
|
|
2004-02-25 04:10:32 +00:00
|
|
|
static int predictor_pole(struct g726_state *state_ptr)
|
|
|
|
{
|
|
|
|
return (fmult(state_ptr->a[1] >> 2, state_ptr->sr[1]) +
|
2004-11-15 00:56:53 +00:00
|
|
|
fmult(state_ptr->a[0] >> 2, state_ptr->sr[0]));
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
|
2004-11-15 00:56:53 +00:00
|
|
|
#endif /* NOT_BLI */
|
|
|
|
|
2004-02-25 04:10:32 +00:00
|
|
|
/*
|
|
|
|
* step_size()
|
|
|
|
*
|
|
|
|
* computes the quantization step size of the adaptive quantizer.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
static int step_size(struct g726_state *state_ptr)
|
|
|
|
{
|
2012-04-17 18:57:40 +00:00
|
|
|
int y, dif, al;
|
|
|
|
|
|
|
|
if (state_ptr->ap >= 256) {
|
|
|
|
return state_ptr->yu;
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
2012-04-17 18:57:40 +00:00
|
|
|
|
|
|
|
y = state_ptr->yl >> 6;
|
|
|
|
dif = state_ptr->yu - y;
|
|
|
|
al = state_ptr->ap >> 2;
|
|
|
|
|
|
|
|
if (dif > 0) {
|
|
|
|
y += (dif * al) >> 6;
|
|
|
|
} else if (dif < 0) {
|
|
|
|
y += (dif * al + 0x3F) >> 6;
|
|
|
|
}
|
|
|
|
return y;
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* quantize()
|
|
|
|
*
|
|
|
|
* Given a raw sample, 'd', of the difference signal and a
|
|
|
|
* quantization step size scale factor, 'y', this routine returns the
|
|
|
|
* ADPCM codeword to which that sample gets quantized. The step
|
|
|
|
* size scale factor division operation is done in the log base 2 domain
|
|
|
|
* as a subtraction.
|
|
|
|
*/
|
|
|
|
static int quantize(
|
|
|
|
int d, /* Raw difference signal sample */
|
|
|
|
int y, /* Step size multiplier */
|
2004-11-15 00:56:53 +00:00
|
|
|
int *table, /* quantization table */
|
|
|
|
int size) /* table size of integers */
|
2004-02-25 04:10:32 +00:00
|
|
|
{
|
2004-11-15 00:56:53 +00:00
|
|
|
int dqm; /* Magnitude of 'd' */
|
|
|
|
int exp; /* Integer part of base 2 log of 'd' */
|
|
|
|
int mant; /* Fractional part of base 2 log */
|
|
|
|
int dl; /* Log of magnitude of 'd' */
|
|
|
|
int dln; /* Step size scale factor normalized log */
|
2004-02-25 04:10:32 +00:00
|
|
|
int i;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* LOG
|
|
|
|
*
|
|
|
|
* Compute base 2 log of 'd', and store in 'dl'.
|
|
|
|
*/
|
|
|
|
dqm = abs(d);
|
2005-05-15 03:18:16 +00:00
|
|
|
exp = ilog2(dqm);
|
2012-04-17 18:57:40 +00:00
|
|
|
if (exp < 0) {
|
2004-11-15 00:56:53 +00:00
|
|
|
exp = 0;
|
2012-04-17 18:57:40 +00:00
|
|
|
}
|
2004-02-25 04:10:32 +00:00
|
|
|
mant = ((dqm << 7) >> exp) & 0x7F; /* Fractional portion. */
|
2004-11-15 00:56:53 +00:00
|
|
|
dl = (exp << 7) | mant;
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* SUBTB
|
|
|
|
*
|
|
|
|
* "Divide" by step size multiplier.
|
|
|
|
*/
|
|
|
|
dln = dl - (y >> 2);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* QUAN
|
|
|
|
*
|
|
|
|
* Obtain codword i for 'd'.
|
|
|
|
*/
|
|
|
|
i = quan(dln, table, size);
|
2012-04-17 18:57:40 +00:00
|
|
|
if (d < 0) { /* take 1's complement of i */
|
2004-02-25 04:10:32 +00:00
|
|
|
return ((size << 1) + 1 - i);
|
2012-04-17 18:57:40 +00:00
|
|
|
} else if (i == 0) { /* take 1's complement of 0 */
|
2004-02-25 04:10:32 +00:00
|
|
|
return ((size << 1) + 1); /* new in 1988 */
|
2012-04-17 18:57:40 +00:00
|
|
|
} else {
|
|
|
|
return i;
|
|
|
|
}
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* reconstruct()
|
|
|
|
*
|
|
|
|
* Returns reconstructed difference signal 'dq' obtained from
|
|
|
|
* codeword 'i' and quantization step size scale factor 'y'.
|
|
|
|
* Multiplication is performed in log base 2 domain as addition.
|
|
|
|
*/
|
|
|
|
static int reconstruct(
|
|
|
|
int sign, /* 0 for non-negative value */
|
|
|
|
int dqln, /* G.72x codeword */
|
|
|
|
int y) /* Step size multiplier */
|
|
|
|
{
|
2004-11-15 00:56:53 +00:00
|
|
|
int dql; /* Log of 'dq' magnitude */
|
|
|
|
int dex; /* Integer part of log */
|
|
|
|
int dqt;
|
|
|
|
int dq; /* Reconstructed difference signal sample */
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
dql = dqln + (y >> 2); /* ADDA */
|
|
|
|
|
|
|
|
if (dql < 0) {
|
2004-11-15 00:56:53 +00:00
|
|
|
#ifdef NOT_BLI
|
|
|
|
return (sign) ? -1 : 1;
|
|
|
|
#else
|
|
|
|
return (sign) ? -0x8000 : 0;
|
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
} else { /* ANTILOG */
|
|
|
|
dex = (dql >> 7) & 15;
|
|
|
|
dqt = 128 + (dql & 127);
|
2004-11-15 00:56:53 +00:00
|
|
|
#ifdef NOT_BLI
|
|
|
|
dq = ((dqt << 19) >> (14 - dex));
|
|
|
|
return (sign) ? -dq : dq;
|
|
|
|
#else
|
2004-02-25 04:10:32 +00:00
|
|
|
dq = (dqt << 7) >> (14 - dex);
|
2004-11-15 00:56:53 +00:00
|
|
|
return (sign) ? (dq - 0x8000) : dq;
|
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* update()
|
|
|
|
*
|
|
|
|
* updates the state variables for each output code
|
|
|
|
*/
|
|
|
|
static void update(
|
|
|
|
int code_size, /* distinguish 723_40 with others */
|
|
|
|
int y, /* quantizer step size */
|
|
|
|
int wi, /* scale factor multiplier */
|
|
|
|
int fi, /* for long/short term energies */
|
|
|
|
int dq, /* quantized prediction difference */
|
|
|
|
int sr, /* reconstructed signal */
|
|
|
|
int dqsez, /* difference from 2-pole predictor */
|
|
|
|
struct g726_state *state_ptr) /* coder state pointer */
|
|
|
|
{
|
|
|
|
int cnt;
|
2004-11-15 00:56:53 +00:00
|
|
|
int mag; /* Adaptive predictor, FLOAT A */
|
|
|
|
#ifndef NOT_BLI
|
|
|
|
int exp;
|
|
|
|
#endif
|
|
|
|
int a2p=0; /* LIMC */
|
|
|
|
int a1ul; /* UPA1 */
|
|
|
|
int pks1; /* UPA2 */
|
|
|
|
int fa1;
|
|
|
|
int tr; /* tone/transition detector */
|
|
|
|
int ylint, thr2, dqthr;
|
|
|
|
int ylfrac, thr1;
|
|
|
|
int pk0;
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
pk0 = (dqsez < 0) ? 1 : 0; /* needed in updating predictor poles */
|
|
|
|
|
2004-11-15 00:56:53 +00:00
|
|
|
#ifdef NOT_BLI
|
|
|
|
mag = abs(dq / 0x1000); /* prediction difference magnitude */
|
|
|
|
#else
|
2004-02-25 04:10:32 +00:00
|
|
|
mag = dq & 0x7FFF; /* prediction difference magnitude */
|
2004-11-15 00:56:53 +00:00
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
/* TRANS */
|
|
|
|
ylint = state_ptr->yl >> 15; /* exponent part of yl */
|
|
|
|
ylfrac = (state_ptr->yl >> 10) & 0x1F; /* fractional part of yl */
|
|
|
|
thr1 = (32 + ylfrac) << ylint; /* threshold */
|
|
|
|
thr2 = (ylint > 9) ? 31 << 10 : thr1; /* limit thr2 to 31 << 10 */
|
|
|
|
dqthr = (thr2 + (thr2 >> 1)) >> 1; /* dqthr = 0.75 * thr2 */
|
2012-04-17 18:57:40 +00:00
|
|
|
if (state_ptr->td == 0) { /* signal supposed voice */
|
2004-02-25 04:10:32 +00:00
|
|
|
tr = 0;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else if (mag <= dqthr) { /* supposed data, but small mag */
|
2004-02-25 04:10:32 +00:00
|
|
|
tr = 0; /* treated as voice */
|
2012-04-17 18:57:40 +00:00
|
|
|
} else { /* signal is data (modem) */
|
2004-02-25 04:10:32 +00:00
|
|
|
tr = 1;
|
2012-04-17 18:57:40 +00:00
|
|
|
}
|
2004-02-25 04:10:32 +00:00
|
|
|
/*
|
|
|
|
* Quantizer scale factor adaptation.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* FUNCTW & FILTD & DELAY */
|
|
|
|
/* update non-steady state step size multiplier */
|
|
|
|
state_ptr->yu = y + ((wi - y) >> 5);
|
|
|
|
|
|
|
|
/* LIMB */
|
2012-04-17 18:57:40 +00:00
|
|
|
if (state_ptr->yu < 544) { /* 544 <= yu <= 5120 */
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->yu = 544;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else if (state_ptr->yu > 5120) {
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->yu = 5120;
|
2012-04-17 18:57:40 +00:00
|
|
|
}
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
/* FILTE & DELAY */
|
|
|
|
/* update steady state step size multiplier */
|
|
|
|
state_ptr->yl += state_ptr->yu + ((-state_ptr->yl) >> 6);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Adaptive predictor coefficients.
|
|
|
|
*/
|
|
|
|
if (tr == 1) { /* reset a's and b's for modem signal */
|
|
|
|
state_ptr->a[0] = 0;
|
|
|
|
state_ptr->a[1] = 0;
|
|
|
|
state_ptr->b[0] = 0;
|
|
|
|
state_ptr->b[1] = 0;
|
|
|
|
state_ptr->b[2] = 0;
|
|
|
|
state_ptr->b[3] = 0;
|
|
|
|
state_ptr->b[4] = 0;
|
|
|
|
state_ptr->b[5] = 0;
|
|
|
|
} else { /* update a's and b's */
|
|
|
|
pks1 = pk0 ^ state_ptr->pk[0]; /* UPA2 */
|
|
|
|
|
|
|
|
/* update predictor pole a[1] */
|
|
|
|
a2p = state_ptr->a[1] - (state_ptr->a[1] >> 7);
|
|
|
|
if (dqsez != 0) {
|
|
|
|
fa1 = (pks1) ? state_ptr->a[0] : -state_ptr->a[0];
|
2012-04-17 18:57:40 +00:00
|
|
|
if (fa1 < -8191) { /* a2p = function of fa1 */
|
2004-02-25 04:10:32 +00:00
|
|
|
a2p -= 0x100;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else if (fa1 > 8191) {
|
2004-02-25 04:10:32 +00:00
|
|
|
a2p += 0xFF;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else {
|
2004-02-25 04:10:32 +00:00
|
|
|
a2p += fa1 >> 5;
|
2012-04-17 18:57:40 +00:00
|
|
|
}
|
2004-02-25 04:10:32 +00:00
|
|
|
|
2012-04-17 18:57:40 +00:00
|
|
|
if (pk0 ^ state_ptr->pk[1]) {
|
2004-02-25 04:10:32 +00:00
|
|
|
/* LIMC */
|
2012-04-17 18:57:40 +00:00
|
|
|
if (a2p <= -12160) {
|
2004-02-25 04:10:32 +00:00
|
|
|
a2p = -12288;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else if (a2p >= 12416) {
|
2004-02-25 04:10:32 +00:00
|
|
|
a2p = 12288;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else {
|
2004-02-25 04:10:32 +00:00
|
|
|
a2p -= 0x80;
|
2012-04-17 18:57:40 +00:00
|
|
|
}
|
|
|
|
} else if (a2p <= -12416) {
|
2004-02-25 04:10:32 +00:00
|
|
|
a2p = -12288;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else if (a2p >= 12160) {
|
2004-02-25 04:10:32 +00:00
|
|
|
a2p = 12288;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else {
|
2004-02-25 04:10:32 +00:00
|
|
|
a2p += 0x80;
|
2012-04-17 18:57:40 +00:00
|
|
|
}
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* TRIGB & DELAY */
|
|
|
|
state_ptr->a[1] = a2p;
|
|
|
|
|
|
|
|
/* UPA1 */
|
|
|
|
/* update predictor pole a[0] */
|
|
|
|
state_ptr->a[0] -= state_ptr->a[0] >> 8;
|
|
|
|
if (dqsez != 0) {
|
|
|
|
if (pks1 == 0)
|
|
|
|
state_ptr->a[0] += 192;
|
|
|
|
else
|
|
|
|
state_ptr->a[0] -= 192;
|
|
|
|
}
|
|
|
|
/* LIMD */
|
|
|
|
a1ul = 15360 - a2p;
|
2012-04-17 18:57:40 +00:00
|
|
|
if (state_ptr->a[0] < -a1ul) {
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->a[0] = -a1ul;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else if (state_ptr->a[0] > a1ul) {
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->a[0] = a1ul;
|
2012-04-17 18:57:40 +00:00
|
|
|
}
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
/* UPB : update predictor zeros b[6] */
|
|
|
|
for (cnt = 0; cnt < 6; cnt++) {
|
2012-04-17 18:57:40 +00:00
|
|
|
if (code_size == 5) { /* for 40Kbps G.723 */
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->b[cnt] -= state_ptr->b[cnt] >> 9;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else { /* for G.721 and 24Kbps G.723 */
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->b[cnt] -= state_ptr->b[cnt] >> 8;
|
2012-04-17 18:57:40 +00:00
|
|
|
}
|
|
|
|
if (mag) { /* XOR */
|
|
|
|
if ((dq ^ state_ptr->dq[cnt]) >= 0) {
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->b[cnt] += 128;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else {
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->b[cnt] -= 128;
|
2012-04-17 18:57:40 +00:00
|
|
|
}
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (cnt = 5; cnt > 0; cnt--)
|
|
|
|
state_ptr->dq[cnt] = state_ptr->dq[cnt-1];
|
2004-11-15 00:56:53 +00:00
|
|
|
#ifdef NOT_BLI
|
|
|
|
state_ptr->dq[0] = dq;
|
|
|
|
#else
|
2004-02-25 04:10:32 +00:00
|
|
|
/* FLOAT A : convert dq[0] to 4-bit exp, 6-bit mantissa f.p. */
|
|
|
|
if (mag == 0) {
|
2004-11-15 00:56:53 +00:00
|
|
|
state_ptr->dq[0] = (dq >= 0) ? 0x20 : 0x20 - 0x400;
|
2004-02-25 04:10:32 +00:00
|
|
|
} else {
|
2005-05-15 03:18:16 +00:00
|
|
|
exp = ilog2(mag) + 1;
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->dq[0] = (dq >= 0) ?
|
|
|
|
(exp << 6) + ((mag << 6) >> exp) :
|
|
|
|
(exp << 6) + ((mag << 6) >> exp) - 0x400;
|
|
|
|
}
|
2004-11-15 00:56:53 +00:00
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
state_ptr->sr[1] = state_ptr->sr[0];
|
2004-11-15 00:56:53 +00:00
|
|
|
#ifdef NOT_BLI
|
|
|
|
state_ptr->sr[0] = sr;
|
|
|
|
#else
|
2004-02-25 04:10:32 +00:00
|
|
|
/* FLOAT B : convert sr to 4-bit exp., 6-bit mantissa f.p. */
|
|
|
|
if (sr == 0) {
|
|
|
|
state_ptr->sr[0] = 0x20;
|
|
|
|
} else if (sr > 0) {
|
2005-05-15 03:18:16 +00:00
|
|
|
exp = ilog2(sr) + 1;
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->sr[0] = (exp << 6) + ((sr << 6) >> exp);
|
2004-11-15 00:56:53 +00:00
|
|
|
} else if (sr > -0x8000) {
|
2004-02-25 04:10:32 +00:00
|
|
|
mag = -sr;
|
2005-05-15 03:18:16 +00:00
|
|
|
exp = ilog2(mag) + 1;
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->sr[0] = (exp << 6) + ((mag << 6) >> exp) - 0x400;
|
|
|
|
} else
|
2004-11-15 00:56:53 +00:00
|
|
|
state_ptr->sr[0] = 0x20 - 0x400;
|
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
/* DELAY A */
|
|
|
|
state_ptr->pk[1] = state_ptr->pk[0];
|
|
|
|
state_ptr->pk[0] = pk0;
|
|
|
|
|
|
|
|
/* TONE */
|
2012-04-17 18:57:40 +00:00
|
|
|
if (tr == 1) { /* this sample has been treated as data */
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->td = 0; /* next one will be treated as voice */
|
2012-04-17 18:57:40 +00:00
|
|
|
} else if (a2p < -11776) { /* small sample-to-sample correlation */
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->td = 1; /* signal may be data */
|
2012-04-17 18:57:40 +00:00
|
|
|
} else { /* signal is voice */
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->td = 0;
|
2012-04-17 18:57:40 +00:00
|
|
|
}
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Adaptation speed control.
|
|
|
|
*/
|
|
|
|
state_ptr->dms += (fi - state_ptr->dms) >> 5; /* FILTA */
|
|
|
|
state_ptr->dml += (((fi << 2) - state_ptr->dml) >> 7); /* FILTB */
|
|
|
|
|
2012-04-17 18:57:40 +00:00
|
|
|
if (tr == 1) {
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->ap = 256;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else if (y < 1536) { /* SUBTC */
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->ap += (0x200 - state_ptr->ap) >> 4;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else if (state_ptr->td == 1) {
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->ap += (0x200 - state_ptr->ap) >> 4;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else if (abs((state_ptr->dms << 2) - state_ptr->dml) >=
|
|
|
|
(state_ptr->dml >> 3)) {
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->ap += (0x200 - state_ptr->ap) >> 4;
|
2012-04-17 18:57:40 +00:00
|
|
|
} else {
|
2004-02-25 04:10:32 +00:00
|
|
|
state_ptr->ap += (-state_ptr->ap) >> 4;
|
2012-04-17 18:57:40 +00:00
|
|
|
}
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* g726_decode()
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
*
|
|
|
|
* Decodes a 4-bit code of G.726-32 encoded data of i and
|
|
|
|
* returns the resulting linear PCM, A-law or u-law value.
|
|
|
|
* return -1 for unknown out_coding value.
|
|
|
|
*/
|
|
|
|
static int g726_decode(int i, struct g726_state *state_ptr)
|
|
|
|
{
|
2004-11-15 00:56:53 +00:00
|
|
|
int sezi, sez, se; /* ACCUM */
|
|
|
|
int y; /* MIX */
|
|
|
|
int sr; /* ADDB */
|
|
|
|
int dq;
|
|
|
|
int dqsez;
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
i &= 0x0f; /* mask to get proper bits */
|
2004-11-15 00:56:53 +00:00
|
|
|
#ifdef NOT_BLI
|
|
|
|
sezi = predictor_zero(state_ptr);
|
|
|
|
sez = sezi;
|
|
|
|
se = sezi + predictor_pole(state_ptr); /* estimated signal */
|
|
|
|
#else
|
2004-02-25 04:10:32 +00:00
|
|
|
sezi = predictor_zero(state_ptr);
|
|
|
|
sez = sezi >> 1;
|
2004-11-15 00:56:53 +00:00
|
|
|
se = (sezi + predictor_pole(state_ptr)) >> 1; /* estimated signal */
|
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
y = step_size(state_ptr); /* dynamic quantizer step size */
|
|
|
|
|
2004-11-15 00:56:53 +00:00
|
|
|
dq = reconstruct(i & 8, _dqlntab[i], y); /* quantized diff. */
|
2004-02-25 04:10:32 +00:00
|
|
|
|
2004-11-15 00:56:53 +00:00
|
|
|
#ifdef NOT_BLI
|
|
|
|
sr = se + dq; /* reconst. signal */
|
|
|
|
dqsez = dq + sez; /* pole prediction diff. */
|
|
|
|
#else
|
|
|
|
sr = (dq < 0) ? se - (dq & 0x3FFF) : se + dq; /* reconst. signal */
|
|
|
|
dqsez = sr - se + sez; /* pole prediction diff. */
|
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
update(4, y, _witab[i] << 5, _fitab[i], dq, sr, dqsez, state_ptr);
|
|
|
|
|
2004-11-15 00:56:53 +00:00
|
|
|
#ifdef NOT_BLI
|
|
|
|
return (sr >> 10); /* sr was 26-bit dynamic range */
|
|
|
|
#else
|
2004-02-25 04:10:32 +00:00
|
|
|
return (sr << 2); /* sr was 14-bit dynamic range */
|
2004-11-15 00:56:53 +00:00
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
2004-11-15 00:56:53 +00:00
|
|
|
|
2004-02-25 04:10:32 +00:00
|
|
|
/*
|
|
|
|
* g726_encode()
|
|
|
|
*
|
|
|
|
* Encodes the input vale of linear PCM, A-law or u-law data sl and returns
|
|
|
|
* the resulting code. -1 is returned for unknown input coding value.
|
|
|
|
*/
|
|
|
|
static int g726_encode(int sl, struct g726_state *state_ptr)
|
|
|
|
{
|
2004-11-15 00:56:53 +00:00
|
|
|
int sezi, se, sez; /* ACCUM */
|
|
|
|
int d; /* SUBTA */
|
|
|
|
int sr; /* ADDB */
|
|
|
|
int y; /* MIX */
|
|
|
|
int dqsez; /* ADDC */
|
|
|
|
int dq, i;
|
|
|
|
|
|
|
|
#ifdef NOT_BLI
|
|
|
|
sl <<= 10; /* 26-bit dynamic range */
|
2004-02-25 04:10:32 +00:00
|
|
|
|
2004-11-15 00:56:53 +00:00
|
|
|
sezi = predictor_zero(state_ptr);
|
|
|
|
sez = sezi;
|
|
|
|
se = sezi + predictor_pole(state_ptr); /* estimated signal */
|
|
|
|
#else
|
2004-02-25 04:10:32 +00:00
|
|
|
sl >>= 2; /* 14-bit dynamic range */
|
|
|
|
|
|
|
|
sezi = predictor_zero(state_ptr);
|
|
|
|
sez = sezi >> 1;
|
|
|
|
se = (sezi + predictor_pole(state_ptr)) >> 1; /* estimated signal */
|
2004-11-15 00:56:53 +00:00
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
d = sl - se; /* estimation difference */
|
|
|
|
|
|
|
|
/* quantize the prediction difference */
|
|
|
|
y = step_size(state_ptr); /* quantizer step size */
|
2004-11-15 00:56:53 +00:00
|
|
|
#ifdef NOT_BLI
|
|
|
|
d /= 0x1000;
|
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
i = quantize(d, y, qtab_721, 7); /* i = G726 code */
|
|
|
|
|
|
|
|
dq = reconstruct(i & 8, _dqlntab[i], y); /* quantized est diff */
|
|
|
|
|
2004-11-15 00:56:53 +00:00
|
|
|
#ifdef NOT_BLI
|
|
|
|
sr = se + dq; /* reconst. signal */
|
|
|
|
dqsez = dq + sez; /* pole prediction diff. */
|
|
|
|
#else
|
2004-02-25 04:10:32 +00:00
|
|
|
sr = (dq < 0) ? se - (dq & 0x3FFF) : se + dq; /* reconst. signal */
|
2004-11-15 00:56:53 +00:00
|
|
|
dqsez = sr - se + sez; /* pole prediction diff. */
|
|
|
|
#endif
|
2004-02-25 04:10:32 +00:00
|
|
|
|
|
|
|
update(4, y, _witab[i] << 5, _fitab[i], dq, sr, dqsez, state_ptr);
|
|
|
|
|
2012-04-17 18:57:40 +00:00
|
|
|
return i;
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2006-04-08 21:40:57 +00:00
|
|
|
* Private workspace for translating signed linear signals to G726.
|
|
|
|
* Don't bother to define two distinct structs.
|
2004-02-25 04:10:32 +00:00
|
|
|
*/
|
|
|
|
|
2006-04-08 21:40:57 +00:00
|
|
|
struct g726_coder_pvt {
|
|
|
|
/* buffer any odd byte in input - 0x80 + (value & 0xf) if present */
|
|
|
|
unsigned char next_flag;
|
|
|
|
struct g726_state g726;
|
2004-02-25 04:10:32 +00:00
|
|
|
};
|
|
|
|
|
2006-04-08 21:40:57 +00:00
|
|
|
/*! \brief init a new instance of g726_coder_pvt. */
|
2006-06-24 19:43:31 +00:00
|
|
|
static int lintog726_new(struct ast_trans_pvt *pvt)
|
2004-02-25 04:10:32 +00:00
|
|
|
{
|
2006-04-08 21:40:57 +00:00
|
|
|
struct g726_coder_pvt *tmp = pvt->pvt;
|
2004-02-25 04:10:32 +00:00
|
|
|
|
2006-04-08 21:40:57 +00:00
|
|
|
g726_init_state(&tmp->g726);
|
2006-06-24 19:43:31 +00:00
|
|
|
|
|
|
|
return 0;
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
|
2006-07-12 22:42:13 +00:00
|
|
|
/*! \brief decode packed 4-bit G726 values (AAL2 packing) and store in buffer. */
|
|
|
|
static int g726aal2tolin_framein (struct ast_trans_pvt *pvt, struct ast_frame *f)
|
2004-02-25 04:10:32 +00:00
|
|
|
{
|
2006-04-08 21:40:57 +00:00
|
|
|
struct g726_coder_pvt *tmp = pvt->pvt;
|
2008-05-22 16:29:54 +00:00
|
|
|
unsigned char *src = f->data.ptr;
|
2008-06-26 17:06:17 +00:00
|
|
|
int16_t *dst = pvt->outbuf.i16 + pvt->samples;
|
2006-07-12 22:42:13 +00:00
|
|
|
unsigned int i;
|
2005-03-17 21:30:19 +00:00
|
|
|
|
2006-07-12 22:42:13 +00:00
|
|
|
for (i = 0; i < f->datalen; i++) {
|
2006-04-08 21:40:57 +00:00
|
|
|
*dst++ = g726_decode((src[i] >> 4) & 0xf, &tmp->g726);
|
|
|
|
*dst++ = g726_decode(src[i] & 0x0f, &tmp->g726);
|
|
|
|
}
|
2006-07-12 22:42:13 +00:00
|
|
|
|
2006-04-08 21:40:57 +00:00
|
|
|
pvt->samples += f->samples;
|
|
|
|
pvt->datalen += 2 * f->samples; /* 2 bytes/sample */
|
2006-07-12 22:42:13 +00:00
|
|
|
|
2006-04-08 21:40:57 +00:00
|
|
|
return 0;
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
|
2006-07-12 22:42:13 +00:00
|
|
|
/*! \brief compress and store data (4-bit G726 samples, AAL2 packing) in outbuf */
|
|
|
|
static int lintog726aal2_framein(struct ast_trans_pvt *pvt, struct ast_frame *f)
|
2004-02-25 04:10:32 +00:00
|
|
|
{
|
2006-04-08 21:40:57 +00:00
|
|
|
struct g726_coder_pvt *tmp = pvt->pvt;
|
2008-05-22 16:29:54 +00:00
|
|
|
int16_t *src = f->data.ptr;
|
2006-07-12 22:42:13 +00:00
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
for (i = 0; i < f->samples; i++) {
|
2006-04-08 21:40:57 +00:00
|
|
|
unsigned char d = g726_encode(src[i], &tmp->g726); /* this sample */
|
2006-07-12 22:42:13 +00:00
|
|
|
|
2006-04-08 21:40:57 +00:00
|
|
|
if (tmp->next_flag & 0x80) { /* merge with leftover sample */
|
2008-06-26 17:06:17 +00:00
|
|
|
pvt->outbuf.c[pvt->datalen++] = ((tmp->next_flag & 0xf)<< 4) | d;
|
2006-04-08 21:40:57 +00:00
|
|
|
pvt->samples += 2; /* 2 samples per byte */
|
|
|
|
tmp->next_flag = 0;
|
|
|
|
} else {
|
|
|
|
tmp->next_flag = 0x80 | d;
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
}
|
2006-07-12 22:42:13 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*! \brief decode packed 4-bit G726 values (RFC3551 packing) and store in buffer. */
|
|
|
|
static int g726tolin_framein (struct ast_trans_pvt *pvt, struct ast_frame *f)
|
|
|
|
{
|
|
|
|
struct g726_coder_pvt *tmp = pvt->pvt;
|
2008-05-22 16:29:54 +00:00
|
|
|
unsigned char *src = f->data.ptr;
|
2008-06-26 17:06:17 +00:00
|
|
|
int16_t *dst = pvt->outbuf.i16 + pvt->samples;
|
2006-07-12 22:42:13 +00:00
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
for (i = 0; i < f->datalen; i++) {
|
|
|
|
*dst++ = g726_decode(src[i] & 0x0f, &tmp->g726);
|
|
|
|
*dst++ = g726_decode((src[i] >> 4) & 0xf, &tmp->g726);
|
|
|
|
}
|
|
|
|
|
|
|
|
pvt->samples += f->samples;
|
|
|
|
pvt->datalen += 2 * f->samples; /* 2 bytes/sample */
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*! \brief compress and store data (4-bit G726 samples, RFC3551 packing) in outbuf */
|
|
|
|
static int lintog726_framein(struct ast_trans_pvt *pvt, struct ast_frame *f)
|
|
|
|
{
|
|
|
|
struct g726_coder_pvt *tmp = pvt->pvt;
|
2008-05-22 16:29:54 +00:00
|
|
|
int16_t *src = f->data.ptr;
|
2006-07-12 22:42:13 +00:00
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
for (i = 0; i < f->samples; i++) {
|
|
|
|
unsigned char d = g726_encode(src[i], &tmp->g726); /* this sample */
|
|
|
|
|
|
|
|
if (tmp->next_flag & 0x80) { /* merge with leftover sample */
|
2008-06-26 17:06:17 +00:00
|
|
|
pvt->outbuf.c[pvt->datalen++] = (d << 4) | (tmp->next_flag & 0xf);
|
2006-07-12 22:42:13 +00:00
|
|
|
pvt->samples += 2; /* 2 samples per byte */
|
|
|
|
tmp->next_flag = 0;
|
|
|
|
} else {
|
|
|
|
tmp->next_flag = 0x80 | d;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2004-02-25 04:10:32 +00:00
|
|
|
static struct ast_translator g726tolin = {
|
2006-04-08 21:40:57 +00:00
|
|
|
.name = "g726tolin",
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
.src_codec = {
|
|
|
|
.name = "g726",
|
|
|
|
.type = AST_MEDIA_TYPE_AUDIO,
|
|
|
|
.sample_rate = 8000,
|
|
|
|
},
|
|
|
|
.dst_codec = {
|
|
|
|
.name = "slin",
|
|
|
|
.type = AST_MEDIA_TYPE_AUDIO,
|
|
|
|
.sample_rate = 8000,
|
|
|
|
},
|
|
|
|
.format = "slin",
|
2006-04-08 21:40:57 +00:00
|
|
|
.newpvt = lintog726_new, /* same for both directions */
|
|
|
|
.framein = g726tolin_framein,
|
2008-10-17 21:35:23 +00:00
|
|
|
.sample = g726_sample,
|
2006-04-08 21:40:57 +00:00
|
|
|
.desc_size = sizeof(struct g726_coder_pvt),
|
|
|
|
.buffer_samples = BUFFER_SAMPLES,
|
|
|
|
.buf_size = BUFFER_SAMPLES * 2,
|
2004-02-25 04:10:32 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct ast_translator lintog726 = {
|
2006-04-08 21:40:57 +00:00
|
|
|
.name = "lintog726",
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
.src_codec = {
|
|
|
|
.name = "slin",
|
|
|
|
.type = AST_MEDIA_TYPE_AUDIO,
|
|
|
|
.sample_rate = 8000,
|
|
|
|
},
|
|
|
|
.dst_codec = {
|
|
|
|
.name = "g726",
|
|
|
|
.type = AST_MEDIA_TYPE_AUDIO,
|
|
|
|
.sample_rate = 8000,
|
|
|
|
},
|
|
|
|
.format = "g726",
|
2006-04-08 21:40:57 +00:00
|
|
|
.newpvt = lintog726_new, /* same for both directions */
|
|
|
|
.framein = lintog726_framein,
|
2008-10-17 21:35:23 +00:00
|
|
|
.sample = slin8_sample,
|
2006-04-08 21:40:57 +00:00
|
|
|
.desc_size = sizeof(struct g726_coder_pvt),
|
|
|
|
.buffer_samples = BUFFER_SAMPLES,
|
|
|
|
.buf_size = BUFFER_SAMPLES/2,
|
2004-02-25 04:10:32 +00:00
|
|
|
};
|
|
|
|
|
2006-07-12 22:42:13 +00:00
|
|
|
static struct ast_translator g726aal2tolin = {
|
|
|
|
.name = "g726aal2tolin",
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
.src_codec = {
|
|
|
|
.name = "g726aal2",
|
|
|
|
.type = AST_MEDIA_TYPE_AUDIO,
|
|
|
|
.sample_rate = 8000,
|
|
|
|
},
|
|
|
|
.dst_codec = {
|
|
|
|
.name = "slin",
|
|
|
|
.type = AST_MEDIA_TYPE_AUDIO,
|
|
|
|
.sample_rate = 8000,
|
|
|
|
},
|
|
|
|
.format = "slin",
|
2006-07-12 22:42:13 +00:00
|
|
|
.newpvt = lintog726_new, /* same for both directions */
|
|
|
|
.framein = g726aal2tolin_framein,
|
2008-10-17 21:35:23 +00:00
|
|
|
.sample = g726_sample,
|
2006-07-12 22:42:13 +00:00
|
|
|
.desc_size = sizeof(struct g726_coder_pvt),
|
|
|
|
.buffer_samples = BUFFER_SAMPLES,
|
|
|
|
.buf_size = BUFFER_SAMPLES * 2,
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct ast_translator lintog726aal2 = {
|
|
|
|
.name = "lintog726aal2",
|
media formats: re-architect handling of media for performance improvements
In the old times media formats were represented using a bit field. This was
fast but had a few limitations.
1. Asterisk was limited in how many formats it could handle.
2. Formats, being a bit field, could not include any attribute information.
A format was strictly its type, e.g., "this is ulaw".
This was changed in Asterisk 10 (see
https://wiki.asterisk.org/wiki/display/AST/Media+Architecture+Proposal for
notes on that work) which led to the creation of the ast_format structure.
This structure allowed Asterisk to handle attributes and bundle information
with a format.
Additionally, ast_format_cap was created to act as a container for multiple
formats that, together, formed the capability of some entity. Another
mechanism was added to allow logic to be registered which performed format
attribute negotiation. Everywhere throughout the codebase Asterisk was
changed to use this strategy.
Unfortunately, in software, there is no free lunch. These new capabilities
came at a cost.
Performance analysis and profiling showed that we spend an inordinate
amount of time comparing, copying, and generally manipulating formats and
their related structures. Basic prototyping has shown that a reasonably
large performance improvement could be made in this area. This patch is the
result of that project, which overhauled the media format architecture
and its usage in Asterisk to improve performance.
Generally, the new philosophy for handling formats is as follows:
* The ast_format structure is reference counted. This removed a large amount
of the memory allocations and copying that was done in prior versions.
* In order to prevent race conditions while keeping things performant, the
ast_format structure is immutable by convention and lock-free. Violate this
tenet at your peril!
* Because formats are reference counted, codecs are also reference counted.
The Asterisk core generally provides built-in codecs and caches the
ast_format structures created to represent them. Generally, to prevent
inordinate amounts of module reference bumping, codecs and formats can be
added at run-time but cannot be removed.
* All compatibility with the bit field representation of codecs/formats has
been moved to a compatibility API. The primary user of this representation
is chan_iax2, which must continue to maintain its bit-field usage of formats
for interoperability concerns.
* When a format is negotiated with attributes, or when a format cannot be
represented by one of the cached formats, a new format object is created or
cloned from an existing format. That format may have the same codec
underlying it, but is a different format than a version of the format with
different attributes or without attributes.
* While formats are reference counted objects, the reference count maintained
on the format should be manipulated with care. Formats are generally cached
and will persist for the lifetime of Asterisk and do not explicitly need
to have their lifetime modified. An exception to this is when the user of a
format does not know where the format came from *and* the user may outlive
the provider of the format. This occurs, for example, when a format is read
from a channel: the channel may have a format with attributes (hence,
non-cached) and the user of the format may last longer than the channel (if
the reference to the channel is released prior to the format's reference).
For more information on this work, see the API design notes:
https://wiki.asterisk.org/wiki/display/AST/Media+Format+Rewrite
Finally, this work was the culmination of a large number of developer's
efforts. Extra thanks goes to Corey Farrell, who took on a large amount of the
work in the Asterisk core, chan_sip, and was an invaluable resource in peer
reviews throughout this project.
There were a substantial number of patches contributed during this work; the
following issues/patch names simply reflect some of the work (and will cause
the release scripts to give attribution to the individuals who work on them).
Reviews:
https://reviewboard.asterisk.org/r/3814
https://reviewboard.asterisk.org/r/3808
https://reviewboard.asterisk.org/r/3805
https://reviewboard.asterisk.org/r/3803
https://reviewboard.asterisk.org/r/3801
https://reviewboard.asterisk.org/r/3798
https://reviewboard.asterisk.org/r/3800
https://reviewboard.asterisk.org/r/3794
https://reviewboard.asterisk.org/r/3793
https://reviewboard.asterisk.org/r/3792
https://reviewboard.asterisk.org/r/3791
https://reviewboard.asterisk.org/r/3790
https://reviewboard.asterisk.org/r/3789
https://reviewboard.asterisk.org/r/3788
https://reviewboard.asterisk.org/r/3787
https://reviewboard.asterisk.org/r/3786
https://reviewboard.asterisk.org/r/3784
https://reviewboard.asterisk.org/r/3783
https://reviewboard.asterisk.org/r/3778
https://reviewboard.asterisk.org/r/3774
https://reviewboard.asterisk.org/r/3775
https://reviewboard.asterisk.org/r/3772
https://reviewboard.asterisk.org/r/3761
https://reviewboard.asterisk.org/r/3754
https://reviewboard.asterisk.org/r/3753
https://reviewboard.asterisk.org/r/3751
https://reviewboard.asterisk.org/r/3750
https://reviewboard.asterisk.org/r/3748
https://reviewboard.asterisk.org/r/3747
https://reviewboard.asterisk.org/r/3746
https://reviewboard.asterisk.org/r/3742
https://reviewboard.asterisk.org/r/3740
https://reviewboard.asterisk.org/r/3739
https://reviewboard.asterisk.org/r/3738
https://reviewboard.asterisk.org/r/3737
https://reviewboard.asterisk.org/r/3736
https://reviewboard.asterisk.org/r/3734
https://reviewboard.asterisk.org/r/3722
https://reviewboard.asterisk.org/r/3713
https://reviewboard.asterisk.org/r/3703
https://reviewboard.asterisk.org/r/3689
https://reviewboard.asterisk.org/r/3687
https://reviewboard.asterisk.org/r/3674
https://reviewboard.asterisk.org/r/3671
https://reviewboard.asterisk.org/r/3667
https://reviewboard.asterisk.org/r/3665
https://reviewboard.asterisk.org/r/3625
https://reviewboard.asterisk.org/r/3602
https://reviewboard.asterisk.org/r/3519
https://reviewboard.asterisk.org/r/3518
https://reviewboard.asterisk.org/r/3516
https://reviewboard.asterisk.org/r/3515
https://reviewboard.asterisk.org/r/3512
https://reviewboard.asterisk.org/r/3506
https://reviewboard.asterisk.org/r/3413
https://reviewboard.asterisk.org/r/3410
https://reviewboard.asterisk.org/r/3387
https://reviewboard.asterisk.org/r/3388
https://reviewboard.asterisk.org/r/3389
https://reviewboard.asterisk.org/r/3390
https://reviewboard.asterisk.org/r/3321
https://reviewboard.asterisk.org/r/3320
https://reviewboard.asterisk.org/r/3319
https://reviewboard.asterisk.org/r/3318
https://reviewboard.asterisk.org/r/3266
https://reviewboard.asterisk.org/r/3265
https://reviewboard.asterisk.org/r/3234
https://reviewboard.asterisk.org/r/3178
ASTERISK-23114 #close
Reported by: mjordan
media_formats_translation_core.diff uploaded by kharwell (License 6464)
rb3506.diff uploaded by mjordan (License 6283)
media_format_app_file.diff uploaded by kharwell (License 6464)
misc-2.diff uploaded by file (License 5000)
chan_mild-3.diff uploaded by file (License 5000)
chan_obscure.diff uploaded by file (License 5000)
jingle.diff uploaded by file (License 5000)
funcs.diff uploaded by file (License 5000)
formats.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
bridges.diff uploaded by file (License 5000)
mf-codecs-2.diff uploaded by file (License 5000)
mf-app_fax.diff uploaded by file (License 5000)
mf-apps-3.diff uploaded by file (License 5000)
media-formats-3.diff uploaded by file (License 5000)
ASTERISK-23715
rb3713.patch uploaded by coreyfarrell (License 5909)
rb3689.patch uploaded by mjordan (License 6283)
ASTERISK-23957
rb3722.patch uploaded by mjordan (License 6283)
mf-attributes-3.diff uploaded by file (License 5000)
ASTERISK-23958
Tested by: jrose
rb3822.patch uploaded by coreyfarrell (License 5909)
rb3800.patch uploaded by jrose (License 6182)
chan_sip.diff uploaded by mjordan (License 6283)
rb3747.patch uploaded by jrose (License 6182)
ASTERISK-23959 #close
Tested by: sgriepentrog, mjordan, coreyfarrell
sip_cleanup.diff uploaded by opticron (License 6273)
chan_sip_caps.diff uploaded by mjordan (License 6283)
rb3751.patch uploaded by coreyfarrell (License 5909)
chan_sip-3.diff uploaded by file (License 5000)
ASTERISK-23960 #close
Tested by: opticron
direct_media.diff uploaded by opticron (License 6273)
pjsip-direct-media.diff uploaded by file (License 5000)
format_cap_remove.diff uploaded by opticron (License 6273)
media_format_fixes.diff uploaded by opticron (License 6273)
chan_pjsip-2.diff uploaded by file (License 5000)
ASTERISK-23966 #close
Tested by: rmudgett
rb3803.patch uploaded by rmudgetti (License 5621)
chan_dahdi.diff uploaded by file (License 5000)
ASTERISK-24064 #close
Tested by: coreyfarrell, mjordan, opticron, file, rmudgett, sgriepentrog, jrose
rb3814.patch uploaded by rmudgett (License 5621)
moh_cleanup.diff uploaded by opticron (License 6273)
bridge_leak.diff uploaded by opticron (License 6273)
translate.diff uploaded by file (License 5000)
rb3795.patch uploaded by rmudgett (License 5621)
tls_fix.diff uploaded by mjordan (License 6283)
fax-mf-fix-2.diff uploaded by file (License 5000)
rtp_transfer_stuff uploaded by mjordan (License 6283)
rb3787.patch uploaded by rmudgett (License 5621)
media-formats-explicit-translate-format-3.diff uploaded by file (License 5000)
format_cache_case_fix.diff uploaded by opticron (License 6273)
rb3774.patch uploaded by rmudgett (License 5621)
rb3775.patch uploaded by rmudgett (License 5621)
rtp_engine_fix.diff uploaded by opticron (License 6273)
rtp_crash_fix.diff uploaded by opticron (License 6273)
rb3753.patch uploaded by mjordan (License 6283)
rb3750.patch uploaded by mjordan (License 6283)
rb3748.patch uploaded by rmudgett (License 5621)
media_format_fixes.diff uploaded by opticron (License 6273)
rb3740.patch uploaded by mjordan (License 6283)
rb3739.patch uploaded by mjordan (License 6283)
rb3734.patch uploaded by mjordan (License 6283)
rb3689.patch uploaded by mjordan (License 6283)
rb3674.patch uploaded by coreyfarrell (License 5909)
rb3671.patch uploaded by coreyfarrell (License 5909)
rb3667.patch uploaded by coreyfarrell (License 5909)
rb3665.patch uploaded by mjordan (License 6283)
rb3625.patch uploaded by coreyfarrell (License 5909)
rb3602.patch uploaded by coreyfarrell (License 5909)
format_compatibility-2.diff uploaded by file (License 5000)
core.diff uploaded by file (License 5000)
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@419044 65c4cc65-6c06-0410-ace0-fbb531ad65f3
2014-07-20 22:06:33 +00:00
|
|
|
.src_codec = {
|
|
|
|
.name = "slin",
|
|
|
|
.type = AST_MEDIA_TYPE_AUDIO,
|
|
|
|
.sample_rate = 8000,
|
|
|
|
},
|
|
|
|
.dst_codec = {
|
|
|
|
.name = "g726aal2",
|
|
|
|
.type = AST_MEDIA_TYPE_AUDIO,
|
|
|
|
.sample_rate = 8000,
|
|
|
|
},
|
|
|
|
.format = "g726aal2",
|
2006-07-12 22:42:13 +00:00
|
|
|
.newpvt = lintog726_new, /* same for both directions */
|
|
|
|
.framein = lintog726aal2_framein,
|
2008-10-17 21:35:23 +00:00
|
|
|
.sample = slin8_sample,
|
2006-07-12 22:42:13 +00:00
|
|
|
.desc_size = sizeof(struct g726_coder_pvt),
|
|
|
|
.buffer_samples = BUFFER_SAMPLES,
|
|
|
|
.buf_size = BUFFER_SAMPLES / 2,
|
|
|
|
};
|
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
static int unload_module(void)
|
2004-02-25 04:10:32 +00:00
|
|
|
{
|
2006-07-12 22:42:13 +00:00
|
|
|
int res = 0;
|
|
|
|
|
|
|
|
res |= ast_unregister_translator(&g726tolin);
|
|
|
|
res |= ast_unregister_translator(&lintog726);
|
|
|
|
|
|
|
|
res |= ast_unregister_translator(&g726aal2tolin);
|
|
|
|
res |= ast_unregister_translator(&lintog726aal2);
|
|
|
|
|
2006-04-08 21:40:57 +00:00
|
|
|
return res;
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
static int load_module(void)
|
2004-02-25 04:10:32 +00:00
|
|
|
{
|
2006-07-12 22:42:13 +00:00
|
|
|
int res = 0;
|
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
res |= ast_register_translator(&g726tolin);
|
|
|
|
res |= ast_register_translator(&lintog726);
|
2006-07-12 22:42:13 +00:00
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
res |= ast_register_translator(&g726aal2tolin);
|
|
|
|
res |= ast_register_translator(&lintog726aal2);
|
2006-07-12 22:42:13 +00:00
|
|
|
|
2007-10-31 19:24:29 +00:00
|
|
|
if (res) {
|
2006-08-21 02:11:39 +00:00
|
|
|
unload_module();
|
2007-10-31 19:24:29 +00:00
|
|
|
return AST_MODULE_LOAD_FAILURE;
|
|
|
|
}
|
2006-07-12 22:42:13 +00:00
|
|
|
|
2007-10-31 19:24:29 +00:00
|
|
|
return AST_MODULE_LOAD_SUCCESS;
|
2004-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
|
2006-08-21 02:11:39 +00:00
|
|
|
AST_MODULE_INFO(ASTERISK_GPL_KEY, AST_MODFLAG_DEFAULT, "ITU G.726-32kbps G726 Transcoder",
|
2014-07-25 16:47:17 +00:00
|
|
|
.support_level = AST_MODULE_SUPPORT_CORE,
|
2006-08-21 02:11:39 +00:00
|
|
|
.load = load_module,
|
|
|
|
.unload = unload_module,
|
|
|
|
);
|