00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026 #include "asterisk.h"
00027
00028 ASTERISK_FILE_VERSION(__FILE__, "$Revision: 181732 $")
00029
00030 #include <sys/time.h>
00031 #include <sys/resource.h>
00032 #include <math.h>
00033
00034 #include "asterisk/lock.h"
00035 #include "asterisk/channel.h"
00036 #include "asterisk/translate.h"
00037 #include "asterisk/module.h"
00038 #include "asterisk/frame.h"
00039 #include "asterisk/sched.h"
00040 #include "asterisk/cli.h"
00041 #include "asterisk/term.h"
00042
00043 #define MAX_RECALC 1000
00044
00045
00046 static AST_RWLIST_HEAD_STATIC(translators, ast_translator);
00047
00048 struct translator_path {
00049 struct ast_translator *step;
00050 unsigned int cost;
00051 unsigned int multistep;
00052 };
00053
00054
00055
00056
00057
00058
00059
00060
00061
00062
00063
00064 static struct translator_path tr_matrix[MAX_FORMAT][MAX_FORMAT];
00065
00066
00067
00068
00069
00070
00071
00072
00073 static force_inline int powerof(unsigned int d)
00074 {
00075 int x = ffs(d);
00076
00077 if (x)
00078 return x - 1;
00079
00080 ast_log(LOG_WARNING, "No bits set? %d\n", d);
00081
00082 return -1;
00083 }
00084
00085
00086
00087
00088
00089
00090
00091
00092
00093 static void *newpvt(struct ast_translator *t)
00094 {
00095 struct ast_trans_pvt *pvt;
00096 int len;
00097 int useplc = t->plc_samples > 0 && t->useplc;
00098 char *ofs;
00099
00100
00101
00102
00103
00104 len = sizeof(*pvt) + t->desc_size;
00105 if (useplc)
00106 len += sizeof(plc_state_t);
00107 if (t->buf_size)
00108 len += AST_FRIENDLY_OFFSET + t->buf_size;
00109 pvt = ast_calloc(1, len);
00110 if (!pvt)
00111 return NULL;
00112 pvt->t = t;
00113 ofs = (char *)(pvt + 1);
00114 if (t->desc_size) {
00115 pvt->pvt = ofs;
00116 ofs += t->desc_size;
00117 }
00118 if (useplc) {
00119 pvt->plc = (plc_state_t *)ofs;
00120 ofs += sizeof(plc_state_t);
00121 }
00122 if (t->buf_size)
00123 pvt->outbuf = ofs + AST_FRIENDLY_OFFSET;
00124
00125 if (t->newpvt && t->newpvt(pvt)) {
00126 ast_free(pvt);
00127 return NULL;
00128 }
00129 ast_module_ref(t->module);
00130 return pvt;
00131 }
00132
00133 static void destroy(struct ast_trans_pvt *pvt)
00134 {
00135 struct ast_translator *t = pvt->t;
00136
00137 if (ast_test_flag(&pvt->f, AST_FRFLAG_FROM_TRANSLATOR)) {
00138
00139
00140
00141
00142
00143 pvt->destroy = 1;
00144
00145 return;
00146 }
00147
00148 if (t->destroy)
00149 t->destroy(pvt);
00150 ast_free(pvt);
00151 ast_module_unref(t->module);
00152 }
00153
00154
00155 static int framein(struct ast_trans_pvt *pvt, struct ast_frame *f)
00156 {
00157 int16_t *dst = (int16_t *)pvt->outbuf;
00158 int ret;
00159 int samples = pvt->samples;
00160
00161
00162 ast_copy_flags(&pvt->f, f, AST_FRFLAG_HAS_TIMING_INFO);
00163 pvt->f.ts = f->ts;
00164 pvt->f.len = f->len;
00165 pvt->f.seqno = f->seqno;
00166
00167 if (f->samples == 0) {
00168 ast_log(LOG_WARNING, "no samples for %s\n", pvt->t->name);
00169 }
00170 if (pvt->t->buffer_samples) {
00171 if (f->datalen == 0) {
00172 if (pvt->plc) {
00173 int l = pvt->t->plc_samples;
00174 if (pvt->samples + l > pvt->t->buffer_samples) {
00175 ast_log(LOG_WARNING, "Out of buffer space\n");
00176 return -1;
00177 }
00178 l = plc_fillin(pvt->plc, dst + pvt->samples, l);
00179 pvt->samples += l;
00180 pvt->datalen = pvt->samples * 2;
00181 }
00182
00183 if (!pvt->t->native_plc)
00184 return 0;
00185 }
00186 if (pvt->samples + f->samples > pvt->t->buffer_samples) {
00187 ast_log(LOG_WARNING, "Out of buffer space\n");
00188 return -1;
00189 }
00190 }
00191
00192
00193
00194 ret = pvt->t->framein(pvt, f);
00195
00196 if (!ret && pvt->plc) {
00197 int l = pvt->t->plc_samples;
00198 if (pvt->samples < l)
00199 l = pvt->samples;
00200 plc_rx(pvt->plc, dst + pvt->samples - l, l);
00201 }
00202
00203 if (pvt->samples == samples)
00204 ast_log(LOG_WARNING, "%s did not update samples %d\n",
00205 pvt->t->name, pvt->samples);
00206 return ret;
00207 }
00208
00209
00210
00211
00212
00213
00214 struct ast_frame *ast_trans_frameout(struct ast_trans_pvt *pvt,
00215 int datalen, int samples)
00216 {
00217 struct ast_frame *f = &pvt->f;
00218
00219 if (samples)
00220 f->samples = samples;
00221 else {
00222 if (pvt->samples == 0)
00223 return NULL;
00224 f->samples = pvt->samples;
00225 pvt->samples = 0;
00226 }
00227 if (datalen)
00228 f->datalen = datalen;
00229 else {
00230 f->datalen = pvt->datalen;
00231 pvt->datalen = 0;
00232 }
00233
00234 f->frametype = AST_FRAME_VOICE;
00235 f->subclass = 1 << (pvt->t->dstfmt);
00236 f->mallocd = 0;
00237 f->offset = AST_FRIENDLY_OFFSET;
00238 f->src = pvt->t->name;
00239 f->data = pvt->outbuf;
00240
00241 ast_set_flag(f, AST_FRFLAG_FROM_TRANSLATOR);
00242
00243 return f;
00244 }
00245
00246 static struct ast_frame *default_frameout(struct ast_trans_pvt *pvt)
00247 {
00248 return ast_trans_frameout(pvt, 0, 0);
00249 }
00250
00251
00252
00253 void ast_translator_free_path(struct ast_trans_pvt *p)
00254 {
00255 struct ast_trans_pvt *pn = p;
00256 while ( (p = pn) ) {
00257 pn = p->next;
00258 destroy(p);
00259 }
00260 }
00261
00262
00263 struct ast_trans_pvt *ast_translator_build_path(int dest, int source)
00264 {
00265 struct ast_trans_pvt *head = NULL, *tail = NULL;
00266
00267 source = powerof(source);
00268 dest = powerof(dest);
00269
00270 if (source == -1 || dest == -1) {
00271 ast_log(LOG_WARNING, "No translator path: (%s codec is not valid)\n", source == -1 ? "starting" : "ending");
00272 return NULL;
00273 }
00274
00275 AST_RWLIST_RDLOCK(&translators);
00276
00277 while (source != dest) {
00278 struct ast_trans_pvt *cur;
00279 struct ast_translator *t = tr_matrix[source][dest].step;
00280 if (!t) {
00281 ast_log(LOG_WARNING, "No translator path from %s to %s\n",
00282 ast_getformatname(source), ast_getformatname(dest));
00283 AST_RWLIST_UNLOCK(&translators);
00284 return NULL;
00285 }
00286 if (!(cur = newpvt(t))) {
00287 ast_log(LOG_WARNING, "Failed to build translator step from %d to %d\n", source, dest);
00288 if (head)
00289 ast_translator_free_path(head);
00290 AST_RWLIST_UNLOCK(&translators);
00291 return NULL;
00292 }
00293 if (!head)
00294 head = cur;
00295 else
00296 tail->next = cur;
00297 tail = cur;
00298 cur->nextin = cur->nextout = ast_tv(0, 0);
00299
00300 source = cur->t->dstfmt;
00301 }
00302
00303 AST_RWLIST_UNLOCK(&translators);
00304 return head;
00305 }
00306
00307
00308 struct ast_frame *ast_translate(struct ast_trans_pvt *path, struct ast_frame *f, int consume)
00309 {
00310 struct ast_trans_pvt *p = path;
00311 struct ast_frame *out = f;
00312 struct timeval delivery;
00313 int has_timing_info;
00314 long ts;
00315 long len;
00316 int seqno;
00317
00318 has_timing_info = ast_test_flag(f, AST_FRFLAG_HAS_TIMING_INFO);
00319 ts = f->ts;
00320 len = f->len;
00321 seqno = f->seqno;
00322
00323
00324 if (!ast_tvzero(f->delivery)) {
00325 if (!ast_tvzero(path->nextin)) {
00326
00327 if (!ast_tveq(path->nextin, f->delivery)) {
00328
00329
00330
00331 if (!ast_tvzero(path->nextout)) {
00332 path->nextout = ast_tvadd(path->nextout,
00333 ast_tvsub(f->delivery, path->nextin));
00334 }
00335 path->nextin = f->delivery;
00336 }
00337 } else {
00338
00339 path->nextin = f->delivery;
00340 path->nextout = f->delivery;
00341 }
00342
00343 path->nextin = ast_tvadd(path->nextin, ast_samp2tv(f->samples, ast_format_rate(f->subclass)));
00344 }
00345 delivery = f->delivery;
00346 for ( ; out && p ; p = p->next) {
00347 framein(p, out);
00348 if (out != f)
00349 ast_frfree(out);
00350 out = p->t->frameout(p);
00351 }
00352 if (consume)
00353 ast_frfree(f);
00354 if (out == NULL)
00355 return NULL;
00356
00357 if (!ast_tvzero(delivery)) {
00358
00359 if (ast_tvzero(path->nextout))
00360 path->nextout = ast_tvnow();
00361
00362
00363 out->delivery = path->nextout;
00364
00365
00366
00367 path->nextout = ast_tvadd(path->nextout, ast_samp2tv(out->samples, ast_format_rate(out->subclass)));
00368 } else {
00369 out->delivery = ast_tv(0, 0);
00370 ast_set2_flag(out, has_timing_info, AST_FRFLAG_HAS_TIMING_INFO);
00371 if (has_timing_info) {
00372 out->ts = ts;
00373 out->len = len;
00374 out->seqno = seqno;
00375 }
00376 }
00377
00378 if (out->frametype == AST_FRAME_CNG)
00379 path->nextout = ast_tv(0, 0);
00380 return out;
00381 }
00382
00383
00384 static void calc_cost(struct ast_translator *t, int seconds)
00385 {
00386 int num_samples = 0;
00387 struct ast_trans_pvt *pvt;
00388 struct rusage start;
00389 struct rusage end;
00390 int cost;
00391 int out_rate = ast_format_rate(t->dstfmt);
00392
00393 if (!seconds)
00394 seconds = 1;
00395
00396
00397 if (!t->sample) {
00398 ast_log(LOG_WARNING, "Translator '%s' does not produce sample frames.\n", t->name);
00399 t->cost = 999999;
00400 return;
00401 }
00402
00403 pvt = newpvt(t);
00404 if (!pvt) {
00405 ast_log(LOG_WARNING, "Translator '%s' appears to be broken and will probably fail.\n", t->name);
00406 t->cost = 999999;
00407 return;
00408 }
00409
00410 getrusage(RUSAGE_SELF, &start);
00411
00412
00413 while (num_samples < seconds * out_rate) {
00414 struct ast_frame *f = t->sample();
00415 if (!f) {
00416 ast_log(LOG_WARNING, "Translator '%s' failed to produce a sample frame.\n", t->name);
00417 destroy(pvt);
00418 t->cost = 999999;
00419 return;
00420 }
00421 framein(pvt, f);
00422 ast_frfree(f);
00423 while ((f = t->frameout(pvt))) {
00424 num_samples += f->samples;
00425 ast_frfree(f);
00426 }
00427 }
00428
00429 getrusage(RUSAGE_SELF, &end);
00430
00431 cost = ((end.ru_utime.tv_sec - start.ru_utime.tv_sec) * 1000000) + end.ru_utime.tv_usec - start.ru_utime.tv_usec;
00432 cost += ((end.ru_stime.tv_sec - start.ru_stime.tv_sec) * 1000000) + end.ru_stime.tv_usec - start.ru_stime.tv_usec;
00433
00434 destroy(pvt);
00435
00436 t->cost = cost / seconds;
00437
00438 if (!t->cost)
00439 t->cost = 1;
00440 }
00441
00442
00443
00444
00445
00446 static void rebuild_matrix(int samples)
00447 {
00448 struct ast_translator *t;
00449 int x;
00450 int y;
00451 int z;
00452
00453 ast_debug(1, "Resetting translation matrix\n");
00454
00455 memset(tr_matrix, '\0', sizeof(tr_matrix));
00456
00457
00458 AST_RWLIST_TRAVERSE(&translators, t, list) {
00459 if (!t->active)
00460 continue;
00461
00462 x = t->srcfmt;
00463 z = t->dstfmt;
00464
00465 if (samples)
00466 calc_cost(t, samples);
00467
00468 if (!tr_matrix[x][z].step || t->cost < tr_matrix[x][z].cost) {
00469 tr_matrix[x][z].step = t;
00470 tr_matrix[x][z].cost = t->cost;
00471 }
00472 }
00473
00474
00475
00476
00477
00478
00479
00480 for (;;) {
00481 int changed = 0;
00482 for (x = 0; x < MAX_FORMAT; x++) {
00483 for (y = 0; y < MAX_FORMAT; y++) {
00484 if (x == y)
00485 continue;
00486
00487 for (z = 0; z<MAX_FORMAT; z++) {
00488 int newcost;
00489
00490 if (z == x || z == y)
00491 continue;
00492 if (!tr_matrix[x][y].step)
00493 continue;
00494 if (!tr_matrix[y][z].step)
00495 continue;
00496 newcost = tr_matrix[x][y].cost + tr_matrix[y][z].cost;
00497 if (tr_matrix[x][z].step && newcost >= tr_matrix[x][z].cost)
00498 continue;
00499
00500
00501
00502
00503
00504 tr_matrix[x][z].step = tr_matrix[x][y].step;
00505 tr_matrix[x][z].cost = newcost;
00506 tr_matrix[x][z].multistep = 1;
00507 ast_debug(3, "Discovered %d cost path from %s to %s, via %s\n", tr_matrix[x][z].cost,
00508 ast_getformatname(1 << x), ast_getformatname(1 << z), ast_getformatname(1 << y));
00509 changed++;
00510 }
00511 }
00512 }
00513 if (!changed)
00514 break;
00515 }
00516 }
00517
00518 static char *handle_cli_core_show_translation(struct ast_cli_entry *e, int cmd, struct ast_cli_args *a)
00519 {
00520 #define SHOW_TRANS 16
00521 int x, y, z;
00522 int curlen = 0, longest = 0, magnitude[SHOW_TRANS] = { 0, };
00523
00524 switch (cmd) {
00525 case CLI_INIT:
00526 e->command = "core show translation [recalc]";
00527 e->usage =
00528 "Usage: core show translation [recalc [<recalc seconds>]]\n"
00529 " Displays known codec translators and the cost associated\n"
00530 " with each conversion. If the argument 'recalc' is supplied along\n"
00531 " with optional number of seconds to test a new test will be performed\n"
00532 " as the chart is being displayed.\n";
00533 return NULL;
00534 case CLI_GENERATE:
00535 return NULL;
00536 }
00537
00538 if (a->argc > 5)
00539 return CLI_SHOWUSAGE;
00540
00541 if (a->argv[3] && !strcasecmp(a->argv[3], "recalc")) {
00542 z = a->argv[4] ? atoi(a->argv[4]) : 1;
00543
00544 if (z <= 0) {
00545 ast_cli(a->fd, " Recalc must be greater than 0. Defaulting to 1.\n");
00546 z = 1;
00547 }
00548
00549 if (z > MAX_RECALC) {
00550 ast_cli(a->fd, " Maximum limit of recalc exceeded by %d, truncating value to %d\n", z - MAX_RECALC, MAX_RECALC);
00551 z = MAX_RECALC;
00552 }
00553 ast_cli(a->fd, " Recalculating Codec Translation (number of sample seconds: %d)\n\n", z);
00554 AST_RWLIST_WRLOCK(&translators);
00555 rebuild_matrix(z);
00556 AST_RWLIST_UNLOCK(&translators);
00557 } else if (a->argc > 3)
00558 return CLI_SHOWUSAGE;
00559
00560 AST_RWLIST_RDLOCK(&translators);
00561
00562 ast_cli(a->fd, " Translation times between formats (in microseconds) for one second of data\n");
00563 ast_cli(a->fd, " Source Format (Rows) Destination Format (Columns)\n\n");
00564
00565 for (x = 0; x < SHOW_TRANS; x++) {
00566 curlen = strlen(ast_getformatname(1 << (x)));
00567 if (curlen > longest)
00568 longest = curlen;
00569 for (y = 0; y < SHOW_TRANS; y++) {
00570 if (tr_matrix[x][y].cost > pow(10, magnitude[x])) {
00571 magnitude[y] = floor(log10(tr_matrix[x][y].cost));
00572 }
00573 }
00574 }
00575 for (x = -1; x < SHOW_TRANS; x++) {
00576 struct ast_str *out = ast_str_alloca(125);
00577
00578 if(x >= 0 && !strcmp(ast_getformatname(1 << (x)), "unknown"))
00579 continue;
00580 ast_str_set(&out, -1, " ");
00581 for (y = -1; y < SHOW_TRANS; y++) {
00582
00583 if (y >= 0 && !strcmp(ast_getformatname(1 << (y)), "unknown"))
00584 continue;
00585 if (y >= 0)
00586 curlen = strlen(ast_getformatname(1 << (y)));
00587 if (y >= 0 && magnitude[y] + 1 > curlen) {
00588 curlen = magnitude[y] + 1;
00589 }
00590 if (curlen < 5)
00591 curlen = 5;
00592 if (x >= 0 && y >= 0 && tr_matrix[x][y].step) {
00593
00594 ast_str_append(&out, -1, "%*d", curlen + 1, tr_matrix[x][y].cost);
00595 } else if (x == -1 && y >= 0) {
00596
00597 ast_str_append(&out, -1, "%*s", curlen + 1, ast_getformatname(1 << (y)) );
00598 } else if (y == -1 && x >= 0) {
00599
00600 ast_str_append(&out, -1, "%*s", longest, ast_getformatname(1 << (x)) );
00601 } else if (x >= 0 && y >= 0) {
00602
00603 ast_str_append(&out, -1, "%*s", curlen + 1, "-");
00604 } else {
00605
00606 ast_str_append(&out, -1, "%*s", longest, "");
00607 }
00608 }
00609 ast_str_append(&out, -1, "\n");
00610 ast_cli(a->fd, "%s", ast_str_buffer(out));
00611 }
00612 AST_RWLIST_UNLOCK(&translators);
00613 return CLI_SUCCESS;
00614 }
00615
00616 static struct ast_cli_entry cli_translate[] = {
00617 AST_CLI_DEFINE(handle_cli_core_show_translation, "Display translation matrix")
00618 };
00619
00620
00621 int __ast_register_translator(struct ast_translator *t, struct ast_module *mod)
00622 {
00623 static int added_cli = 0;
00624 struct ast_translator *u;
00625 char tmp[80];
00626
00627 if (!mod) {
00628 ast_log(LOG_WARNING, "Missing module pointer, you need to supply one\n");
00629 return -1;
00630 }
00631
00632 if (!t->buf_size) {
00633 ast_log(LOG_WARNING, "empty buf size, you need to supply one\n");
00634 return -1;
00635 }
00636
00637 t->module = mod;
00638
00639 t->srcfmt = powerof(t->srcfmt);
00640 t->dstfmt = powerof(t->dstfmt);
00641 t->active = 1;
00642
00643 if (t->srcfmt == -1 || t->dstfmt == -1) {
00644 ast_log(LOG_WARNING, "Invalid translator path: (%s codec is not valid)\n", t->srcfmt == -1 ? "starting" : "ending");
00645 return -1;
00646 }
00647 if (t->plc_samples) {
00648 if (t->buffer_samples < t->plc_samples) {
00649 ast_log(LOG_WARNING, "plc_samples %d buffer_samples %d\n",
00650 t->plc_samples, t->buffer_samples);
00651 return -1;
00652 }
00653 if (t->dstfmt != powerof(AST_FORMAT_SLINEAR))
00654 ast_log(LOG_WARNING, "plc_samples %d format %x\n",
00655 t->plc_samples, t->dstfmt);
00656 }
00657 if (t->srcfmt >= MAX_FORMAT) {
00658 ast_log(LOG_WARNING, "Source format %s is larger than MAX_FORMAT\n", ast_getformatname(t->srcfmt));
00659 return -1;
00660 }
00661
00662 if (t->dstfmt >= MAX_FORMAT) {
00663 ast_log(LOG_WARNING, "Destination format %s is larger than MAX_FORMAT\n", ast_getformatname(t->dstfmt));
00664 return -1;
00665 }
00666
00667 if (t->buf_size) {
00668
00669
00670
00671
00672 struct _test_align { void *a, *b; } p;
00673 int align = (char *)&p.b - (char *)&p.a;
00674
00675 t->buf_size = ((t->buf_size + align - 1) / align) * align;
00676 }
00677
00678 if (t->frameout == NULL)
00679 t->frameout = default_frameout;
00680
00681 calc_cost(t, 1);
00682
00683 ast_verb(2, "Registered translator '%s' from format %s to %s, cost %d\n",
00684 term_color(tmp, t->name, COLOR_MAGENTA, COLOR_BLACK, sizeof(tmp)),
00685 ast_getformatname(1 << t->srcfmt), ast_getformatname(1 << t->dstfmt), t->cost);
00686
00687 if (!added_cli) {
00688 ast_cli_register_multiple(cli_translate, sizeof(cli_translate) / sizeof(struct ast_cli_entry));
00689 added_cli++;
00690 }
00691
00692 AST_RWLIST_WRLOCK(&translators);
00693
00694
00695
00696 AST_RWLIST_TRAVERSE_SAFE_BEGIN(&translators, u, list) {
00697 if ((u->srcfmt == t->srcfmt) &&
00698 (u->dstfmt == t->dstfmt) &&
00699 (u->cost > t->cost)) {
00700 AST_RWLIST_INSERT_BEFORE_CURRENT(t, list);
00701 t = NULL;
00702 }
00703 }
00704 AST_RWLIST_TRAVERSE_SAFE_END;
00705
00706
00707
00708 if (t)
00709 AST_RWLIST_INSERT_HEAD(&translators, t, list);
00710
00711 rebuild_matrix(0);
00712
00713 AST_RWLIST_UNLOCK(&translators);
00714
00715 return 0;
00716 }
00717
00718
00719 int ast_unregister_translator(struct ast_translator *t)
00720 {
00721 char tmp[80];
00722 struct ast_translator *u;
00723 int found = 0;
00724
00725 AST_RWLIST_WRLOCK(&translators);
00726 AST_RWLIST_TRAVERSE_SAFE_BEGIN(&translators, u, list) {
00727 if (u == t) {
00728 AST_RWLIST_REMOVE_CURRENT(list);
00729 ast_verb(2, "Unregistered translator '%s' from format %s to %s\n", term_color(tmp, t->name, COLOR_MAGENTA, COLOR_BLACK, sizeof(tmp)), ast_getformatname(1 << t->srcfmt), ast_getformatname(1 << t->dstfmt));
00730 found = 1;
00731 break;
00732 }
00733 }
00734 AST_RWLIST_TRAVERSE_SAFE_END;
00735
00736 if (found)
00737 rebuild_matrix(0);
00738
00739 AST_RWLIST_UNLOCK(&translators);
00740
00741 return (u ? 0 : -1);
00742 }
00743
00744 void ast_translator_activate(struct ast_translator *t)
00745 {
00746 AST_RWLIST_WRLOCK(&translators);
00747 t->active = 1;
00748 rebuild_matrix(0);
00749 AST_RWLIST_UNLOCK(&translators);
00750 }
00751
00752 void ast_translator_deactivate(struct ast_translator *t)
00753 {
00754 AST_RWLIST_WRLOCK(&translators);
00755 t->active = 0;
00756 rebuild_matrix(0);
00757 AST_RWLIST_UNLOCK(&translators);
00758 }
00759
00760
00761 int ast_translator_best_choice(int *dst, int *srcs)
00762 {
00763 int x,y;
00764 int best = -1;
00765 int bestdst = 0;
00766 int cur, cursrc;
00767 int besttime = INT_MAX;
00768 int beststeps = INT_MAX;
00769 int common = ((*dst) & (*srcs)) & AST_FORMAT_AUDIO_MASK;
00770
00771 if (common) {
00772 for (cur = 1, y = 0; y <= MAX_AUDIO_FORMAT; cur <<= 1, y++) {
00773 if (cur & common)
00774 break;
00775 }
00776
00777 *srcs = *dst = cur;
00778 return 0;
00779 } else {
00780 AST_RWLIST_RDLOCK(&translators);
00781 for (cur = 1, y = 0; y <= MAX_AUDIO_FORMAT; cur <<= 1, y++) {
00782 if (! (cur & *dst))
00783 continue;
00784 for (cursrc = 1, x = 0; x <= MAX_AUDIO_FORMAT; cursrc <<= 1, x++) {
00785 if (!(*srcs & cursrc) || !tr_matrix[x][y].step ||
00786 tr_matrix[x][y].cost > besttime)
00787 continue;
00788 if (tr_matrix[x][y].cost < besttime ||
00789 tr_matrix[x][y].multistep < beststeps) {
00790
00791 best = cursrc;
00792 bestdst = cur;
00793 besttime = tr_matrix[x][y].cost;
00794 beststeps = tr_matrix[x][y].multistep;
00795 }
00796 }
00797 }
00798 AST_RWLIST_UNLOCK(&translators);
00799 if (best > -1) {
00800 *srcs = best;
00801 *dst = bestdst;
00802 best = 0;
00803 }
00804 return best;
00805 }
00806 }
00807
00808 unsigned int ast_translate_path_steps(unsigned int dest, unsigned int src)
00809 {
00810 unsigned int res = -1;
00811
00812
00813 src = powerof(src);
00814 dest = powerof(dest);
00815
00816 if (src == -1 || dest == -1) {
00817 ast_log(LOG_WARNING, "No translator path: (%s codec is not valid)\n", src == -1 ? "starting" : "ending");
00818 return -1;
00819 }
00820 AST_RWLIST_RDLOCK(&translators);
00821
00822 if (tr_matrix[src][dest].step)
00823 res = tr_matrix[src][dest].multistep + 1;
00824
00825 AST_RWLIST_UNLOCK(&translators);
00826
00827 return res;
00828 }
00829
00830 unsigned int ast_translate_available_formats(unsigned int dest, unsigned int src)
00831 {
00832 unsigned int res = dest;
00833 unsigned int x;
00834 unsigned int src_audio = src & AST_FORMAT_AUDIO_MASK;
00835 unsigned int src_video = src & AST_FORMAT_VIDEO_MASK;
00836
00837
00838
00839 if (!src)
00840 return dest;
00841
00842
00843 if (src_audio)
00844 src_audio = powerof(src_audio);
00845
00846
00847 if (src_video)
00848 src_video = powerof(src_video);
00849
00850 AST_RWLIST_RDLOCK(&translators);
00851
00852
00853
00854
00855
00856 for (x = 1; src_audio && (x & AST_FORMAT_AUDIO_MASK); x <<= 1) {
00857
00858 if (!dest & x)
00859 continue;
00860
00861
00862
00863 if (src & x)
00864 continue;
00865
00866
00867
00868 if (!tr_matrix[src_audio][powerof(x)].step) {
00869 res &= ~x;
00870 continue;
00871 }
00872
00873
00874 if (!tr_matrix[powerof(x)][src_audio].step)
00875 res &= ~x;
00876 }
00877
00878
00879
00880
00881
00882 for (; src_video && (x & AST_FORMAT_VIDEO_MASK); x <<= 1) {
00883
00884 if (!dest & x)
00885 continue;
00886
00887
00888
00889 if (src & x)
00890 continue;
00891
00892
00893
00894 if (!tr_matrix[src_video][powerof(x)].step) {
00895 res &= ~x;
00896 continue;
00897 }
00898
00899
00900 if (!tr_matrix[powerof(x)][src_video].step)
00901 res &= ~x;
00902 }
00903
00904 AST_RWLIST_UNLOCK(&translators);
00905
00906 return res;
00907 }
00908
00909 void ast_translate_frame_freed(struct ast_frame *fr)
00910 {
00911 struct ast_trans_pvt *pvt;
00912
00913 ast_clear_flag(fr, AST_FRFLAG_FROM_TRANSLATOR);
00914
00915 pvt = (struct ast_trans_pvt *) (((char *) fr) - offsetof(struct ast_trans_pvt, f));
00916
00917 if (!pvt->destroy)
00918 return;
00919
00920 destroy(pvt);
00921 }