mirror of https://github.com/asterisk/asterisk
git-svn-id: https://origsvn.digium.com/svn/asterisk/trunk@88 65c4cc65-6c06-0410-ace0-fbb531ad65f31.0
parent
b1b4b545f2
commit
a5be519ba4
@ -0,0 +1,600 @@
|
|||||||
|
/*
|
||||||
|
* Asterisk -- A telephony toolkit for Linux.
|
||||||
|
*
|
||||||
|
* Translate via the use of pseudo channels
|
||||||
|
*
|
||||||
|
* Copyright (C) 1999, Adtran Inc. and Linux Support Services, LLC
|
||||||
|
*
|
||||||
|
* Mark Spencer <markster@linux-support.net>
|
||||||
|
*
|
||||||
|
* This program is free software, distributed under the terms of
|
||||||
|
* the GNU General Public License
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <asterisk/channel.h>
|
||||||
|
#include <asterisk/channel_pvt.h>
|
||||||
|
#include <asterisk/logger.h>
|
||||||
|
#include <asterisk/translate.h>
|
||||||
|
#include <asterisk/options.h>
|
||||||
|
#include <sys/socket.h>
|
||||||
|
#include <sys/time.h>
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <pthread.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
|
||||||
|
static char *type = "Trans";
|
||||||
|
|
||||||
|
static pthread_mutex_t list_lock = PTHREAD_MUTEX_INITIALIZER;
|
||||||
|
static struct ast_translator *list = NULL;
|
||||||
|
|
||||||
|
struct ast_translator_dir {
|
||||||
|
struct ast_translator *step; /* Next step translator */
|
||||||
|
int cost; /* Complete cost to destination */
|
||||||
|
};
|
||||||
|
|
||||||
|
static struct ast_translator_dir tr_matrix[MAX_FORMAT][MAX_FORMAT];
|
||||||
|
|
||||||
|
struct ast_trans_pvt {
|
||||||
|
struct ast_translator *step;
|
||||||
|
struct ast_translator_pvt *state;
|
||||||
|
struct ast_trans_pvt *next;
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
static int powerof(int d)
|
||||||
|
{
|
||||||
|
int x;
|
||||||
|
for (x = 0; x < 32; x++)
|
||||||
|
if ((1 << x) & d)
|
||||||
|
return x;
|
||||||
|
ast_log(LOG_WARNING, "Powerof %d: No power??\n", d);
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
struct translator_pvt {
|
||||||
|
/* Sockets for communication */
|
||||||
|
int comm[2];
|
||||||
|
struct ast_trans_pvt *system;
|
||||||
|
struct ast_trans_pvt *rsystem;
|
||||||
|
};
|
||||||
|
|
||||||
|
static int translator_hangup(struct ast_channel *chan)
|
||||||
|
{
|
||||||
|
ast_log(LOG_WARNING, "Explicit hangup on '%s' not recommended! Call translator_destroy() instead.\n", chan->name);
|
||||||
|
chan->master->trans = NULL;
|
||||||
|
ast_hangup(chan->master);
|
||||||
|
chan->master = NULL;
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int translator_send_digit(struct ast_channel *chan, char digit)
|
||||||
|
{
|
||||||
|
/* Pass digits right along */
|
||||||
|
if (chan->master->pvt->send_digit)
|
||||||
|
return chan->master->pvt->send_digit(chan->master, digit);
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int translator_call(struct ast_channel *chan, char *addr, int timeout)
|
||||||
|
{
|
||||||
|
if (chan->master->pvt->call)
|
||||||
|
return chan->master->pvt->call(chan->master, addr, timeout);
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int translator_answer(struct ast_channel *chan)
|
||||||
|
{
|
||||||
|
if (chan->master->pvt->answer)
|
||||||
|
return chan->master->pvt->answer(chan->master);
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
void ast_translator_free_path(struct ast_trans_pvt *p)
|
||||||
|
{
|
||||||
|
struct ast_trans_pvt *pl;
|
||||||
|
while(p) {
|
||||||
|
pl = p;
|
||||||
|
p = p->next;
|
||||||
|
if (pl->state && pl->step->destroy)
|
||||||
|
pl->step->destroy(pl->state);
|
||||||
|
free(pl);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static void ast_translator_free(struct translator_pvt *pvt)
|
||||||
|
{
|
||||||
|
ast_translator_free_path(pvt->system);
|
||||||
|
ast_translator_free_path(pvt->rsystem);
|
||||||
|
if (pvt->comm[0] > -1)
|
||||||
|
close(pvt->comm[0]);
|
||||||
|
if (pvt->comm[1] > -1)
|
||||||
|
close(pvt->comm[1]);
|
||||||
|
free(pvt);
|
||||||
|
}
|
||||||
|
|
||||||
|
struct ast_trans_pvt *ast_translator_build_path(int source, int dest)
|
||||||
|
{
|
||||||
|
struct ast_trans_pvt *tmpr = NULL, *tmp = NULL;
|
||||||
|
/* One of the hardest parts: Build a set of translators based upon
|
||||||
|
the given source and destination formats */
|
||||||
|
source = powerof(source);
|
||||||
|
dest = powerof(dest);
|
||||||
|
while(source != dest) {
|
||||||
|
if (tr_matrix[source][dest].step) {
|
||||||
|
if (tmp) {
|
||||||
|
tmp->next = malloc(sizeof(struct ast_trans_pvt));
|
||||||
|
tmp = tmp->next;
|
||||||
|
} else
|
||||||
|
tmp = malloc(sizeof(struct ast_trans_pvt));
|
||||||
|
|
||||||
|
|
||||||
|
if (tmp) {
|
||||||
|
tmp->next = NULL;
|
||||||
|
tmp->step = tr_matrix[source][dest].step;
|
||||||
|
tmp->state = tmp->step->new();
|
||||||
|
if (!tmp->state) {
|
||||||
|
free(tmp);
|
||||||
|
tmp = NULL;
|
||||||
|
}
|
||||||
|
/* Set the root, if it doesn't exist yet... */
|
||||||
|
if (!tmpr)
|
||||||
|
tmpr = tmp;
|
||||||
|
/* Keep going if this isn't the final destination */
|
||||||
|
source = tmp->step->dstfmt;
|
||||||
|
} else {
|
||||||
|
/* XXX This could leak XXX */
|
||||||
|
ast_log(LOG_WARNING, "Out of memory\n");
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return tmpr;
|
||||||
|
}
|
||||||
|
|
||||||
|
static struct ast_frame *fd_read(int fd)
|
||||||
|
{
|
||||||
|
/* XXX Wrong: Not thread safe! XXX */
|
||||||
|
char buf[4096];
|
||||||
|
int res;
|
||||||
|
struct ast_frame *f = (struct ast_frame *)buf;
|
||||||
|
/* Read a frame directly from there. They're always in the
|
||||||
|
right format. */
|
||||||
|
|
||||||
|
if (read(fd, buf, sizeof(struct ast_frame))
|
||||||
|
== sizeof(struct ast_frame)) {
|
||||||
|
/* read the frame header */
|
||||||
|
f->mallocd = 0;
|
||||||
|
f->data = buf + sizeof(struct ast_frame) + AST_FRIENDLY_OFFSET;
|
||||||
|
f->offset = AST_FRIENDLY_OFFSET;
|
||||||
|
if (f->datalen > sizeof(buf) - sizeof(struct ast_frame) - AST_FRIENDLY_OFFSET) {
|
||||||
|
/* Really bad read */
|
||||||
|
ast_log(LOG_WARNING, "Strange read (%d bytes)\n", f->datalen);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
if (f->datalen) {
|
||||||
|
if ((res = read(fd, f->data, f->datalen)) != f->datalen) {
|
||||||
|
/* Bad read */
|
||||||
|
ast_log(LOG_WARNING, "How very strange, expected %d, got %d\n", f->datalen, res);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return ast_frisolate(f);
|
||||||
|
} else if (option_debug)
|
||||||
|
ast_log(LOG_DEBUG, "NULL or invalid header\n");
|
||||||
|
/* Null if there was an error */
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
static struct ast_frame *translator_read(struct ast_channel *chan)
|
||||||
|
{
|
||||||
|
return fd_read(chan->fd);
|
||||||
|
}
|
||||||
|
|
||||||
|
static int fd_write(int fd, struct ast_frame *frame)
|
||||||
|
{
|
||||||
|
/* Write the frame exactly */
|
||||||
|
if (write(fd, frame, sizeof(struct ast_frame)) != sizeof(struct ast_frame)) {
|
||||||
|
ast_log(LOG_WARNING, "Write error\n");
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
if (write(fd, frame->data, frame->datalen) != frame->datalen) {
|
||||||
|
ast_log(LOG_WARNING, "Write error\n");
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int translator_write(struct ast_channel *chan, struct ast_frame *frame)
|
||||||
|
{
|
||||||
|
return fd_write(chan->fd, frame);
|
||||||
|
}
|
||||||
|
|
||||||
|
struct ast_frame_chain *ast_translate(struct ast_trans_pvt *path, struct ast_frame *f)
|
||||||
|
{
|
||||||
|
struct ast_trans_pvt *p;
|
||||||
|
struct ast_frame *out;
|
||||||
|
struct ast_frame_chain *outc = NULL, *prev = NULL, *cur;
|
||||||
|
p = path;
|
||||||
|
/* Feed the first frame into the first translator */
|
||||||
|
p->step->framein(p->state, f);
|
||||||
|
while(p) {
|
||||||
|
/* Read all the frames from the current translator */
|
||||||
|
while((out = p->step->frameout(p->state))) {
|
||||||
|
if (p->next) {
|
||||||
|
/* Feed to next layer */
|
||||||
|
p->next->step->framein(p->next->state, out);
|
||||||
|
} else {
|
||||||
|
/* Last layer -- actually do something */
|
||||||
|
cur = malloc(sizeof(struct ast_frame_chain));
|
||||||
|
if (!cur) {
|
||||||
|
/* XXX Leak majorly on a problem XXX */
|
||||||
|
ast_log(LOG_WARNING, "Out of memory\n");
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
if (prev)
|
||||||
|
prev->next = cur;
|
||||||
|
else
|
||||||
|
outc = cur;
|
||||||
|
cur->fr = ast_frisolate(out);
|
||||||
|
cur->next = NULL;
|
||||||
|
if (prev)
|
||||||
|
prev = prev->next;
|
||||||
|
else
|
||||||
|
prev = outc;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
p = p->next;
|
||||||
|
}
|
||||||
|
return outc;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* XXX There's an experimentally derived fudge factor XXX */
|
||||||
|
#define FUDGE 4
|
||||||
|
|
||||||
|
static void translator_apply(struct ast_trans_pvt *path, struct ast_frame *f, int fd, struct ast_channel *c)
|
||||||
|
{
|
||||||
|
struct ast_trans_pvt *p;
|
||||||
|
struct ast_frame *out;
|
||||||
|
p = path;
|
||||||
|
/* Feed the first frame into the first translator */
|
||||||
|
p->step->framein(p->state, f);
|
||||||
|
while(p) {
|
||||||
|
/* Read all the frames from the current translator */
|
||||||
|
while((out = p->step->frameout(p->state))) {
|
||||||
|
if (p->next) {
|
||||||
|
/* Feed to next layer */
|
||||||
|
p->next->step->framein(p->next->state, out);
|
||||||
|
} else {
|
||||||
|
if (c)
|
||||||
|
ast_write(c, out);
|
||||||
|
else
|
||||||
|
fd_write(fd, out);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
p = p->next;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static void *translator_thread(void *data)
|
||||||
|
{
|
||||||
|
struct ast_channel *real = data;
|
||||||
|
struct ast_frame *f;
|
||||||
|
int ms = -1;
|
||||||
|
struct translator_pvt *pvt = NULL;
|
||||||
|
int fd = -1;
|
||||||
|
int fds[2];
|
||||||
|
int res;
|
||||||
|
/* Read from the real, translate, write as necessary to the fake */
|
||||||
|
for(;;) {
|
||||||
|
if (!real->trans) {
|
||||||
|
ast_log(LOG_WARNING, "No translator anymore\n");
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
pvt = real->trans->pvt->pvt;
|
||||||
|
fd = pvt->comm[1];
|
||||||
|
fds[0] = fd;
|
||||||
|
fds[1] = real->fd;
|
||||||
|
CHECK_BLOCKING(real);
|
||||||
|
res = ast_waitfor_n_fd(fds, 2, &ms);
|
||||||
|
real->blocking = 0;
|
||||||
|
if (res >= 0) {
|
||||||
|
if (res == real->fd) {
|
||||||
|
f = ast_read(real);
|
||||||
|
if (!f) {
|
||||||
|
if (option_debug)
|
||||||
|
ast_log(LOG_DEBUG, "Empty frame\n");
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
if (f->frametype == AST_FRAME_VOICE) {
|
||||||
|
if (pvt->system)
|
||||||
|
translator_apply(pvt->system, f, fd, NULL);
|
||||||
|
} else {
|
||||||
|
/* If it's not voice, just pass it along */
|
||||||
|
fd_write(fd, f);
|
||||||
|
}
|
||||||
|
ast_frfree(f);
|
||||||
|
} else {
|
||||||
|
f = fd_read(res);
|
||||||
|
if (!f) {
|
||||||
|
if (option_debug)
|
||||||
|
ast_log(LOG_DEBUG, "Empty (hangup) frame\n");
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
if (f->frametype == AST_FRAME_VOICE) {
|
||||||
|
if (pvt->rsystem)
|
||||||
|
translator_apply(pvt->rsystem, f, -1, real);
|
||||||
|
} else {
|
||||||
|
ast_write(real, f);
|
||||||
|
}
|
||||||
|
ast_frfree(f);
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
ast_log(LOG_DEBUG, "Waitfor returned non-zero\n");
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (pvt)
|
||||||
|
pvt->comm[1] = -1;
|
||||||
|
if (fd > -1) {
|
||||||
|
/* Write a bogus frame */
|
||||||
|
write(fd, data, 1);
|
||||||
|
close(fd);
|
||||||
|
}
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
struct ast_channel *ast_translator_create(struct ast_channel *real, int format, int direction)
|
||||||
|
{
|
||||||
|
struct ast_channel *tmp;
|
||||||
|
struct translator_pvt *pvt;
|
||||||
|
pthread_t t;
|
||||||
|
if (real->trans) {
|
||||||
|
ast_log(LOG_WARNING, "Translator already exists on '%s'\n", real->name);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
if (!(pvt = malloc(sizeof(struct translator_pvt)))) {
|
||||||
|
ast_log(LOG_WARNING, "Unable to allocate private translator on '%s'\n", real->name);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
pvt->comm[0] = -1;
|
||||||
|
pvt->comm[1] = -1;
|
||||||
|
if (socketpair(AF_UNIX, SOCK_DGRAM, 0, pvt->comm)) {
|
||||||
|
ast_log(LOG_WARNING, "Unable to create UNIX domain socket on '%s'\n", real->name);
|
||||||
|
ast_translator_free(pvt);
|
||||||
|
}
|
||||||
|
/* In to the system */
|
||||||
|
if (direction & AST_DIRECTION_IN)
|
||||||
|
pvt->system = ast_translator_build_path(real->format, format);
|
||||||
|
else
|
||||||
|
pvt->system = NULL;
|
||||||
|
/* Out from the system */
|
||||||
|
if (direction & AST_DIRECTION_OUT)
|
||||||
|
pvt->rsystem = ast_translator_build_path(format, real->format);
|
||||||
|
else
|
||||||
|
pvt->rsystem = NULL;
|
||||||
|
if (!pvt->system && !pvt->rsystem) {
|
||||||
|
ast_log(LOG_WARNING, "Unable to build a translation path for %s (%d to %d)\n", real->name, real->format, format);
|
||||||
|
ast_translator_free(pvt);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
if (!pvt->system && (direction & AST_DIRECTION_IN)) {
|
||||||
|
ast_log(LOG_WARNING, "Translation path for '%s' is one-way (reverse)\n", real->name);
|
||||||
|
ast_translator_free(pvt);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
if (!pvt->rsystem && (direction & AST_DIRECTION_OUT)) {
|
||||||
|
ast_log(LOG_WARNING, "Translation path for '%s' is one-way (forward)\n", real->name);
|
||||||
|
ast_translator_free(pvt);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
if ((tmp = ast_channel_alloc())) {
|
||||||
|
snprintf(tmp->name, sizeof(tmp->name), "%s/Translate:%d", real->name, format);
|
||||||
|
tmp->type = type;
|
||||||
|
tmp->fd = pvt->comm[0];
|
||||||
|
tmp->format = format;
|
||||||
|
tmp->state = real->state;
|
||||||
|
tmp->rings = 0;
|
||||||
|
tmp->pvt->pvt = pvt;
|
||||||
|
tmp->master = real;
|
||||||
|
tmp->pvt->send_digit = translator_send_digit;
|
||||||
|
tmp->pvt->call = translator_call;
|
||||||
|
tmp->pvt->hangup = translator_hangup;
|
||||||
|
tmp->pvt->answer = translator_answer;
|
||||||
|
tmp->pvt->read = translator_read;
|
||||||
|
tmp->pvt->write = translator_write;
|
||||||
|
real->trans = tmp;
|
||||||
|
if (option_verbose > 2)
|
||||||
|
ast_verbose(VERBOSE_PREFIX_3 "Created translator %s\n", tmp->name);
|
||||||
|
if (pthread_create(&t, NULL, translator_thread, real) < 0) {
|
||||||
|
ast_translator_destroy(tmp);
|
||||||
|
tmp = NULL;
|
||||||
|
ast_log(LOG_WARNING, "Failed to start thread\n");
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
ast_translator_free(pvt);
|
||||||
|
ast_log(LOG_WARNING, "Unable to allocate channel\n");
|
||||||
|
}
|
||||||
|
return tmp;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void rebuild_matrix()
|
||||||
|
{
|
||||||
|
struct ast_translator *t;
|
||||||
|
int changed;
|
||||||
|
int x,y,z;
|
||||||
|
if (option_debug)
|
||||||
|
ast_log(LOG_DEBUG, "Reseting translation matrix\n");
|
||||||
|
/* Use the list of translators to build a translation matrix */
|
||||||
|
bzero(tr_matrix, sizeof(tr_matrix));
|
||||||
|
t = list;
|
||||||
|
while(t) {
|
||||||
|
if (!tr_matrix[t->srcfmt][t->dstfmt].step ||
|
||||||
|
tr_matrix[t->srcfmt][t->dstfmt].cost > t->cost) {
|
||||||
|
tr_matrix[t->srcfmt][t->dstfmt].step = t;
|
||||||
|
tr_matrix[t->srcfmt][t->dstfmt].cost = t->cost;
|
||||||
|
}
|
||||||
|
t = t->next;
|
||||||
|
}
|
||||||
|
do {
|
||||||
|
changed = 0;
|
||||||
|
/* Don't you just love O(N^3) operations? */
|
||||||
|
for (x=0; x< MAX_FORMAT; x++) /* For each source format */
|
||||||
|
for (y=0; y < MAX_FORMAT; y++) /* And each destination format */
|
||||||
|
if (x != y) /* Except ourselves, of course */
|
||||||
|
for (z=0; z < MAX_FORMAT; z++) /* And each format it might convert to */
|
||||||
|
if ((x!=z) && (y!=z)) /* Don't ever convert back to us */
|
||||||
|
if (tr_matrix[x][y].step && /* We can convert from x to y */
|
||||||
|
tr_matrix[y][z].step && /* And from y to z and... */
|
||||||
|
(!tr_matrix[x][z].step || /* Either there isn't an x->z conversion */
|
||||||
|
(tr_matrix[x][y].cost +
|
||||||
|
tr_matrix[y][z].cost < /* Or we're cheaper than the existing */
|
||||||
|
tr_matrix[x][z].cost) /* solution */
|
||||||
|
)) {
|
||||||
|
/* We can get from x to z via y with a cost that
|
||||||
|
is the sum of the transition from x to y and
|
||||||
|
from y to z */
|
||||||
|
|
||||||
|
tr_matrix[x][z].step = tr_matrix[x][y].step;
|
||||||
|
tr_matrix[x][z].cost = tr_matrix[x][y].cost +
|
||||||
|
tr_matrix[y][z].cost;
|
||||||
|
if (option_debug)
|
||||||
|
ast_log(LOG_DEBUG, "Discovered %d cost path from %d to %d, via %d\n", tr_matrix[x][z].cost, x, z, y);
|
||||||
|
changed++;
|
||||||
|
}
|
||||||
|
|
||||||
|
} while (changed);
|
||||||
|
}
|
||||||
|
|
||||||
|
static void calc_cost(struct ast_translator *t)
|
||||||
|
{
|
||||||
|
int sofar=0;
|
||||||
|
struct ast_translator_pvt *pvt;
|
||||||
|
struct ast_frame *f, *out;
|
||||||
|
struct timeval start, finish;
|
||||||
|
int cost;
|
||||||
|
/* If they don't make samples, give them a terrible score */
|
||||||
|
if (!t->sample) {
|
||||||
|
ast_log(LOG_WARNING, "Translator '%s' does not produce sample frames.\n", t->name);
|
||||||
|
t->cost = 99999;
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
pvt = t->new();
|
||||||
|
if (!pvt) {
|
||||||
|
ast_log(LOG_WARNING, "Translator '%s' appears to be broken and will probably fail.\n", t->name);
|
||||||
|
t->cost = 99999;
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
gettimeofday(&start, NULL);
|
||||||
|
/* Call the encoder until we've processed one second of time */
|
||||||
|
while(sofar < 1000) {
|
||||||
|
f = t->sample();
|
||||||
|
if (!f) {
|
||||||
|
ast_log(LOG_WARNING, "Translator '%s' failed to produce a sample frame.\n", t->name);
|
||||||
|
t->destroy(pvt);
|
||||||
|
t->cost = 99999;
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
t->framein(pvt, f);
|
||||||
|
ast_frfree(f);
|
||||||
|
while((out = t->frameout(pvt))) {
|
||||||
|
sofar += out->timelen;
|
||||||
|
ast_frfree(out);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
gettimeofday(&finish, NULL);
|
||||||
|
t->destroy(pvt);
|
||||||
|
cost = (finish.tv_sec - start.tv_sec) * 1000 + (finish.tv_usec - start.tv_usec) / 1000;
|
||||||
|
t->cost = cost;
|
||||||
|
}
|
||||||
|
|
||||||
|
int ast_register_translator(struct ast_translator *t)
|
||||||
|
{
|
||||||
|
t->srcfmt = powerof(t->srcfmt);
|
||||||
|
t->dstfmt = powerof(t->dstfmt);
|
||||||
|
if ((t->srcfmt >= MAX_FORMAT) || (t->dstfmt >= MAX_FORMAT)) {
|
||||||
|
ast_log(LOG_WARNING, "Format %d is larger than MAX_FORMAT\n", t->srcfmt);
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
calc_cost(t);
|
||||||
|
if (option_verbose > 1)
|
||||||
|
ast_verbose(VERBOSE_PREFIX_2 "Registered translator '%s' from format %d to %d, cost %d\n", t->name, t->srcfmt, t->dstfmt, t->cost);
|
||||||
|
pthread_mutex_lock(&list_lock);
|
||||||
|
t->next = list;
|
||||||
|
list = t;
|
||||||
|
rebuild_matrix();
|
||||||
|
pthread_mutex_unlock(&list_lock);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int ast_unregister_translator(struct ast_translator *t)
|
||||||
|
{
|
||||||
|
struct ast_translator *u, *ul = NULL;
|
||||||
|
pthread_mutex_lock(&list_lock);
|
||||||
|
u = list;
|
||||||
|
while(u) {
|
||||||
|
if (u == t) {
|
||||||
|
if (ul)
|
||||||
|
ul->next = u->next;
|
||||||
|
else
|
||||||
|
list = u->next;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
u = u->next;
|
||||||
|
}
|
||||||
|
rebuild_matrix();
|
||||||
|
pthread_mutex_unlock(&list_lock);
|
||||||
|
return (u ? 0 : -1);
|
||||||
|
}
|
||||||
|
|
||||||
|
void ast_translator_destroy(struct ast_channel *trans)
|
||||||
|
{
|
||||||
|
char dummy;
|
||||||
|
int ms = 1000;
|
||||||
|
if (!trans->master) {
|
||||||
|
ast_log(LOG_WARNING, "Translator is not part of a real channel?\n");
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
if (trans->master->trans != trans) {
|
||||||
|
ast_log(LOG_WARNING, "Translator is not the right one!?!?\n");
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
trans->master->trans = NULL;
|
||||||
|
/* Write an invalid frame to kill off the main thread, which will
|
||||||
|
in turn acknowledge by writing an invalid frame back to us, unless
|
||||||
|
they're already closed. */
|
||||||
|
if (trans->fd > -1) {
|
||||||
|
if (write(trans->fd, trans, 1) == 1) {
|
||||||
|
/* Wait for a respnose, but no more than 1 second */
|
||||||
|
if (ast_waitfor_n_fd(&trans->fd, 1, &ms) == trans->fd)
|
||||||
|
read(trans->fd, &dummy, 1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (option_verbose > 2)
|
||||||
|
ast_verbose(VERBOSE_PREFIX_3 "Destroyed translator %s\n", trans->name);
|
||||||
|
close(trans->fd);
|
||||||
|
ast_channel_free(trans);
|
||||||
|
}
|
||||||
|
|
||||||
|
int ast_translator_best_choice(int dst, int srcs)
|
||||||
|
{
|
||||||
|
/* Calculate our best source format, given costs, and a desired destination */
|
||||||
|
int x;
|
||||||
|
int best=-1;
|
||||||
|
int besttime=999999999;
|
||||||
|
dst = powerof(dst);
|
||||||
|
pthread_mutex_lock(&list_lock);
|
||||||
|
for (x=0;x<MAX_FORMAT;x++) {
|
||||||
|
if (tr_matrix[x][dst].step && /* There's a step */
|
||||||
|
(tr_matrix[x][dst].cost < besttime) && /* We're better than what exists now */
|
||||||
|
(srcs & (1 << x))) /* x is a valid source format */
|
||||||
|
{
|
||||||
|
best = 1 << x;
|
||||||
|
besttime = tr_matrix[x][dst].cost;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
pthread_mutex_unlock(&list_lock);
|
||||||
|
return best;
|
||||||
|
}
|
Loading…
Reference in new issue