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
00027
00028
00029
00030 #include "asterisk.h"
00031
00032 ASTERISK_FILE_VERSION(__FILE__, "$Revision: 369001 $")
00033
00034 #include <sys/time.h>
00035 #include <sys/resource.h>
00036 #include <math.h>
00037
00038 #include "asterisk/lock.h"
00039 #include "asterisk/channel.h"
00040 #include "asterisk/translate.h"
00041 #include "asterisk/module.h"
00042 #include "asterisk/frame.h"
00043 #include "asterisk/sched.h"
00044 #include "asterisk/cli.h"
00045 #include "asterisk/term.h"
00046
00047 #define MAX_RECALC 1000
00048
00049
00050 static AST_RWLIST_HEAD_STATIC(translators, ast_translator);
00051
00052
00053
00054
00055
00056
00057 enum path_samp_change {
00058
00059
00060
00061
00062 AST_TRANS_COST_LL_LL_ORIGSAMP = 400000,
00063
00064 AST_TRANS_COST_LL_LY_ORIGSAMP = 600000,
00065
00066
00067 AST_TRANS_COST_LL_LL_UPSAMP = 800000,
00068
00069 AST_TRANS_COST_LL_LY_UPSAMP = 825000,
00070
00071
00072 AST_TRANS_COST_LL_LL_DOWNSAMP = 850000,
00073
00074 AST_TRANS_COST_LL_LY_DOWNSAMP = 875000,
00075
00076
00077
00078
00079 AST_TRANS_COST_LL_UNKNOWN = 885000,
00080
00081
00082
00083
00084 AST_TRANS_COST_LY_LL_ORIGSAMP = 900000,
00085
00086 AST_TRANS_COST_LY_LY_ORIGSAMP = 915000,
00087
00088
00089 AST_TRANS_COST_LY_LL_UPSAMP = 930000,
00090
00091 AST_TRANS_COST_LY_LY_UPSAMP = 945000,
00092
00093
00094 AST_TRANS_COST_LY_LL_DOWNSAMP = 960000,
00095
00096 AST_TRANS_COST_LY_LY_DOWNSAMP = 975000,
00097
00098
00099
00100
00101 AST_TRANS_COST_LY_UNKNOWN = 985000,
00102 };
00103
00104 struct translator_path {
00105 struct ast_translator *step;
00106 unsigned int cost;
00107 unsigned int multistep;
00108 enum path_samp_change rate_change;
00109 };
00110
00111
00112
00113
00114
00115
00116
00117
00118
00119
00120
00121 static struct translator_path tr_matrix[MAX_FORMAT][MAX_FORMAT];
00122
00123
00124
00125
00126
00127
00128
00129
00130 static force_inline int powerof(format_t d)
00131 {
00132 int x = ffsll(d);
00133
00134 if (x)
00135 return x - 1;
00136
00137 ast_log(LOG_WARNING, "No bits set? %llu\n", (unsigned long long) d);
00138
00139 return -1;
00140 }
00141
00142
00143
00144
00145
00146
00147
00148
00149
00150 static void *newpvt(struct ast_translator *t)
00151 {
00152 struct ast_trans_pvt *pvt;
00153 int len;
00154 char *ofs;
00155
00156
00157
00158
00159
00160 len = sizeof(*pvt) + t->desc_size;
00161 if (t->buf_size)
00162 len += AST_FRIENDLY_OFFSET + t->buf_size;
00163 pvt = ast_calloc(1, len);
00164 if (!pvt)
00165 return NULL;
00166 pvt->t = t;
00167 ofs = (char *)(pvt + 1);
00168 if (t->desc_size) {
00169 pvt->pvt = ofs;
00170 ofs += t->desc_size;
00171 }
00172 if (t->buf_size)
00173 pvt->outbuf.c = ofs + AST_FRIENDLY_OFFSET;
00174
00175 if (t->newpvt && t->newpvt(pvt)) {
00176 ast_free(pvt);
00177 return NULL;
00178 }
00179 ast_module_ref(t->module);
00180 return pvt;
00181 }
00182
00183 static void destroy(struct ast_trans_pvt *pvt)
00184 {
00185 struct ast_translator *t = pvt->t;
00186
00187 if (t->destroy)
00188 t->destroy(pvt);
00189 ast_free(pvt);
00190 ast_module_unref(t->module);
00191 }
00192
00193
00194 static int framein(struct ast_trans_pvt *pvt, struct ast_frame *f)
00195 {
00196 int ret;
00197 int samples = pvt->samples;
00198
00199
00200 ast_copy_flags(&pvt->f, f, AST_FRFLAG_HAS_TIMING_INFO);
00201 pvt->f.ts = f->ts;
00202 pvt->f.len = f->len;
00203 pvt->f.seqno = f->seqno;
00204
00205 if (f->samples == 0) {
00206 ast_log(LOG_WARNING, "no samples for %s\n", pvt->t->name);
00207 }
00208 if (pvt->t->buffer_samples) {
00209 if (f->datalen == 0) {
00210
00211 if (!pvt->t->native_plc)
00212 return 0;
00213 }
00214 if (pvt->samples + f->samples > pvt->t->buffer_samples) {
00215 ast_log(LOG_WARNING, "Out of buffer space\n");
00216 return -1;
00217 }
00218 }
00219
00220
00221
00222 ret = pvt->t->framein(pvt, f);
00223
00224 if (pvt->samples == samples)
00225 ast_log(LOG_WARNING, "%s did not update samples %d\n",
00226 pvt->t->name, pvt->samples);
00227 return ret;
00228 }
00229
00230
00231
00232
00233
00234
00235 struct ast_frame *ast_trans_frameout(struct ast_trans_pvt *pvt,
00236 int datalen, int samples)
00237 {
00238 struct ast_frame *f = &pvt->f;
00239
00240 if (samples)
00241 f->samples = samples;
00242 else {
00243 if (pvt->samples == 0)
00244 return NULL;
00245 f->samples = pvt->samples;
00246 pvt->samples = 0;
00247 }
00248 if (datalen)
00249 f->datalen = datalen;
00250 else {
00251 f->datalen = pvt->datalen;
00252 pvt->datalen = 0;
00253 }
00254
00255 f->frametype = AST_FRAME_VOICE;
00256 f->subclass.codec = 1LL << (pvt->t->dstfmt);
00257 f->mallocd = 0;
00258 f->offset = AST_FRIENDLY_OFFSET;
00259 f->src = pvt->t->name;
00260 f->data.ptr = pvt->outbuf.c;
00261
00262 return ast_frisolate(f);
00263 }
00264
00265 static struct ast_frame *default_frameout(struct ast_trans_pvt *pvt)
00266 {
00267 return ast_trans_frameout(pvt, 0, 0);
00268 }
00269
00270
00271
00272 void ast_translator_free_path(struct ast_trans_pvt *p)
00273 {
00274 struct ast_trans_pvt *pn = p;
00275 while ( (p = pn) ) {
00276 pn = p->next;
00277 destroy(p);
00278 }
00279 }
00280
00281
00282 struct ast_trans_pvt *ast_translator_build_path(format_t dest, format_t source)
00283 {
00284 struct ast_trans_pvt *head = NULL, *tail = NULL;
00285
00286 source = powerof(source);
00287 dest = powerof(dest);
00288
00289 if (source == -1 || dest == -1) {
00290 ast_log(LOG_WARNING, "No translator path: (%s codec is not valid)\n", source == -1 ? "starting" : "ending");
00291 return NULL;
00292 }
00293
00294 AST_RWLIST_RDLOCK(&translators);
00295
00296 while (source != dest) {
00297 struct ast_trans_pvt *cur;
00298 struct ast_translator *t = tr_matrix[source][dest].step;
00299 if (!t) {
00300 ast_log(LOG_WARNING, "No translator path from %s to %s\n",
00301 ast_getformatname(source), ast_getformatname(dest));
00302 AST_RWLIST_UNLOCK(&translators);
00303 return NULL;
00304 }
00305 if (!(cur = newpvt(t))) {
00306 ast_log(LOG_WARNING, "Failed to build translator step from %s to %s\n",
00307 ast_getformatname(source), ast_getformatname(dest));
00308 if (head)
00309 ast_translator_free_path(head);
00310 AST_RWLIST_UNLOCK(&translators);
00311 return NULL;
00312 }
00313 if (!head)
00314 head = cur;
00315 else
00316 tail->next = cur;
00317 tail = cur;
00318 cur->nextin = cur->nextout = ast_tv(0, 0);
00319
00320 source = cur->t->dstfmt;
00321 }
00322
00323 AST_RWLIST_UNLOCK(&translators);
00324 return head;
00325 }
00326
00327
00328 struct ast_frame *ast_translate(struct ast_trans_pvt *path, struct ast_frame *f, int consume)
00329 {
00330 struct ast_trans_pvt *p = path;
00331 struct ast_frame *out = f;
00332 struct timeval delivery;
00333 int has_timing_info;
00334 long ts;
00335 long len;
00336 int seqno;
00337
00338 has_timing_info = ast_test_flag(f, AST_FRFLAG_HAS_TIMING_INFO);
00339 ts = f->ts;
00340 len = f->len;
00341 seqno = f->seqno;
00342
00343
00344 if (!ast_tvzero(f->delivery)) {
00345 if (!ast_tvzero(path->nextin)) {
00346
00347 if (!ast_tveq(path->nextin, f->delivery)) {
00348
00349
00350
00351 if (!ast_tvzero(path->nextout)) {
00352 path->nextout = ast_tvadd(path->nextout,
00353 ast_tvsub(f->delivery, path->nextin));
00354 }
00355 path->nextin = f->delivery;
00356 }
00357 } else {
00358
00359 path->nextin = f->delivery;
00360 path->nextout = f->delivery;
00361 }
00362
00363 path->nextin = ast_tvadd(path->nextin, ast_samp2tv(f->samples, ast_format_rate(f->subclass.codec)));
00364 }
00365 delivery = f->delivery;
00366 for ( ; out && p ; p = p->next) {
00367 framein(p, out);
00368 if (out != f)
00369 ast_frfree(out);
00370 out = p->t->frameout(p);
00371 }
00372 if (consume)
00373 ast_frfree(f);
00374 if (out == NULL)
00375 return NULL;
00376
00377 if (!ast_tvzero(delivery)) {
00378
00379 if (ast_tvzero(path->nextout))
00380 path->nextout = ast_tvnow();
00381
00382
00383 out->delivery = path->nextout;
00384
00385
00386
00387 path->nextout = ast_tvadd(path->nextout, ast_samp2tv(out->samples, ast_format_rate(out->subclass.codec)));
00388 } else {
00389 out->delivery = ast_tv(0, 0);
00390 ast_set2_flag(out, has_timing_info, AST_FRFLAG_HAS_TIMING_INFO);
00391 if (has_timing_info) {
00392 out->ts = ts;
00393 out->len = len;
00394 out->seqno = seqno;
00395 }
00396 }
00397
00398 if (out->frametype == AST_FRAME_CNG)
00399 path->nextout = ast_tv(0, 0);
00400 return out;
00401 }
00402
00403
00404 static void calc_cost(struct ast_translator *t, int seconds)
00405 {
00406 int num_samples = 0;
00407 struct ast_trans_pvt *pvt;
00408 struct rusage start;
00409 struct rusage end;
00410 int cost;
00411 int out_rate = ast_format_rate(t->dstfmt);
00412
00413 if (!seconds)
00414 seconds = 1;
00415
00416
00417 if (!t->sample) {
00418 ast_log(LOG_WARNING, "Translator '%s' does not produce sample frames.\n", t->name);
00419 t->cost = 999999;
00420 return;
00421 }
00422
00423 pvt = newpvt(t);
00424 if (!pvt) {
00425 ast_log(LOG_WARNING, "Translator '%s' appears to be broken and will probably fail.\n", t->name);
00426 t->cost = 999999;
00427 return;
00428 }
00429
00430 getrusage(RUSAGE_SELF, &start);
00431
00432
00433 while (num_samples < seconds * out_rate) {
00434 struct ast_frame *f = t->sample();
00435 if (!f) {
00436 ast_log(LOG_WARNING, "Translator '%s' failed to produce a sample frame.\n", t->name);
00437 destroy(pvt);
00438 t->cost = 999999;
00439 return;
00440 }
00441 framein(pvt, f);
00442 ast_frfree(f);
00443 while ((f = t->frameout(pvt))) {
00444 num_samples += f->samples;
00445 ast_frfree(f);
00446 }
00447 }
00448
00449 getrusage(RUSAGE_SELF, &end);
00450
00451 cost = ((end.ru_utime.tv_sec - start.ru_utime.tv_sec) * 1000000) + end.ru_utime.tv_usec - start.ru_utime.tv_usec;
00452 cost += ((end.ru_stime.tv_sec - start.ru_stime.tv_sec) * 1000000) + end.ru_stime.tv_usec - start.ru_stime.tv_usec;
00453
00454 destroy(pvt);
00455
00456 t->cost = cost / seconds;
00457
00458 if (!t->cost)
00459 t->cost = 1;
00460 }
00461
00462 static enum path_samp_change get_rate_change_result(format_t src, format_t dst)
00463 {
00464 int src_ll = src == AST_FORMAT_SLINEAR || src == AST_FORMAT_SLINEAR16;
00465 int dst_ll = dst == AST_FORMAT_SLINEAR || src == AST_FORMAT_SLINEAR16;
00466 int src_rate = ast_format_rate(src);
00467 int dst_rate = ast_format_rate(dst);
00468
00469 if (src_ll) {
00470 if (dst_ll && (src_rate == dst_rate)) {
00471 return AST_TRANS_COST_LL_LL_ORIGSAMP;
00472 } else if (!dst_ll && (src_rate == dst_rate)) {
00473 return AST_TRANS_COST_LL_LY_ORIGSAMP;
00474 } else if (dst_ll && (src_rate < dst_rate)) {
00475 return AST_TRANS_COST_LL_LL_UPSAMP;
00476 } else if (!dst_ll && (src_rate < dst_rate)) {
00477 return AST_TRANS_COST_LL_LY_UPSAMP;
00478 } else if (dst_ll && (src_rate > dst_rate)) {
00479 return AST_TRANS_COST_LL_LL_DOWNSAMP;
00480 } else if (!dst_ll && (src_rate > dst_rate)) {
00481 return AST_TRANS_COST_LL_LY_DOWNSAMP;
00482 } else {
00483 return AST_TRANS_COST_LL_UNKNOWN;
00484 }
00485 } else {
00486 if (dst_ll && (src_rate == dst_rate)) {
00487 return AST_TRANS_COST_LY_LL_ORIGSAMP;
00488 } else if (!dst_ll && (src_rate == dst_rate)) {
00489 return AST_TRANS_COST_LY_LY_ORIGSAMP;
00490 } else if (dst_ll && (src_rate < dst_rate)) {
00491 return AST_TRANS_COST_LY_LL_UPSAMP;
00492 } else if (!dst_ll && (src_rate < dst_rate)) {
00493 return AST_TRANS_COST_LY_LY_UPSAMP;
00494 } else if (dst_ll && (src_rate > dst_rate)) {
00495 return AST_TRANS_COST_LY_LL_DOWNSAMP;
00496 } else if (!dst_ll && (src_rate > dst_rate)) {
00497 return AST_TRANS_COST_LY_LY_DOWNSAMP;
00498 } else {
00499 return AST_TRANS_COST_LY_UNKNOWN;
00500 }
00501 }
00502 }
00503
00504
00505
00506
00507
00508 static void rebuild_matrix(int samples)
00509 {
00510 struct ast_translator *t;
00511 int new_rate_change;
00512 int newcost;
00513 int x;
00514 int y;
00515 int z;
00516
00517 ast_debug(1, "Resetting translation matrix\n");
00518
00519 memset(tr_matrix, '\0', sizeof(tr_matrix));
00520
00521
00522 AST_RWLIST_TRAVERSE(&translators, t, list) {
00523 if (!t->active)
00524 continue;
00525
00526 x = t->srcfmt;
00527 z = t->dstfmt;
00528
00529 if (samples)
00530 calc_cost(t, samples);
00531
00532 new_rate_change = get_rate_change_result(1LL << t->srcfmt, 1LL << t->dstfmt);
00533
00534
00535
00536
00537
00538
00539 if (!tr_matrix[x][z].step ||
00540 ((t->cost < tr_matrix[x][z].cost) && (new_rate_change <= tr_matrix[x][z].rate_change)) ||
00541 (new_rate_change < tr_matrix[x][z].rate_change)) {
00542
00543 tr_matrix[x][z].step = t;
00544 tr_matrix[x][z].cost = t->cost;
00545 tr_matrix[x][z].rate_change = new_rate_change;
00546 }
00547 }
00548
00549
00550
00551
00552
00553
00554
00555 for (;;) {
00556 int changed = 0;
00557 int better_choice = 0;
00558 for (x = 0; x < MAX_FORMAT; x++) {
00559 for (y = 0; y < MAX_FORMAT; y++) {
00560 if (x == y)
00561 continue;
00562 for (z = 0; z < MAX_FORMAT; z++) {
00563 if (z == x || z == y)
00564 continue;
00565 if (!tr_matrix[x][y].step)
00566 continue;
00567 if (!tr_matrix[y][z].step)
00568 continue;
00569
00570
00571
00572
00573 if (tr_matrix[x][z].step &&
00574 ((tr_matrix[x][z].rate_change < tr_matrix[x][y].rate_change) ||
00575 (tr_matrix[x][z].rate_change < tr_matrix[y][z].rate_change))) {
00576 continue;
00577 }
00578
00579
00580 new_rate_change = tr_matrix[x][y].rate_change + tr_matrix[y][z].rate_change;
00581
00582
00583 newcost = tr_matrix[x][y].cost + tr_matrix[y][z].cost;
00584
00585
00586
00587
00588
00589 if (!tr_matrix[x][z].step) {
00590 better_choice = 1;
00591 } else if (new_rate_change < tr_matrix[x][z].rate_change) {
00592 better_choice = 1;
00593 } else {
00594 better_choice = 0;
00595 }
00596
00597 if (!better_choice) {
00598 continue;
00599 }
00600
00601
00602 tr_matrix[x][z].step = tr_matrix[x][y].step;
00603 tr_matrix[x][z].cost = newcost;
00604 tr_matrix[x][z].multistep = 1;
00605
00606
00607
00608
00609
00610 tr_matrix[x][z].rate_change = tr_matrix[x][y].rate_change + tr_matrix[y][z].rate_change;
00611
00612 ast_debug(3, "Discovered %d cost path from %s to %s, via %s\n", tr_matrix[x][z].cost,
00613 ast_getformatname(1LL << x), ast_getformatname(1LL << z), ast_getformatname(1LL << y));
00614 changed++;
00615 }
00616 }
00617 }
00618 if (!changed)
00619 break;
00620 }
00621 }
00622
00623 const char *ast_translate_path_to_str(struct ast_trans_pvt *p, struct ast_str **str)
00624 {
00625 struct ast_trans_pvt *pn = p;
00626
00627 if (!p || !p->t) {
00628 return "";
00629 }
00630
00631 ast_str_set(str, 0, "%s", ast_getformatname(1LL << p->t->srcfmt));
00632
00633 while ( (p = pn) ) {
00634 pn = p->next;
00635 ast_str_append(str, 0, "->%s", ast_getformatname(1LL << p->t->dstfmt));
00636 }
00637
00638 return ast_str_buffer(*str);
00639 }
00640
00641 static char *complete_trans_path_choice(const char *line, const char *word, int pos, int state)
00642 {
00643 int which = 0;
00644 int wordlen = strlen(word);
00645 int i;
00646 char *ret = NULL;
00647 size_t len = 0;
00648 const struct ast_format_list *format_list = ast_get_format_list(&len);
00649
00650 for (i = 0; i < len; i++) {
00651 if (!(format_list[i].bits & AST_FORMAT_AUDIO_MASK)) {
00652 continue;
00653 }
00654 if (!strncasecmp(word, format_list[i].name, wordlen) && ++which > state) {
00655 ret = ast_strdup(format_list[i].name);
00656 break;
00657 }
00658 }
00659 return ret;
00660 }
00661
00662 static char *handle_cli_core_show_translation(struct ast_cli_entry *e, int cmd, struct ast_cli_args *a)
00663 {
00664 #define SHOW_TRANS 64
00665 static const char * const option1[] = { "recalc", "paths", NULL };
00666 int x, y, z;
00667 int curlen = 0, longest = 0, magnitude[SHOW_TRANS] = { 0, };
00668
00669 switch (cmd) {
00670 case CLI_INIT:
00671 e->command = "core show translation";
00672 e->usage =
00673 "Usage: 'core show translation' can be used in two ways.\n"
00674 " 1. 'core show translation [recalc [<recalc seconds>]]\n"
00675 " Displays known codec translators and the cost associated\n"
00676 " with each conversion. If the argument 'recalc' is supplied along\n"
00677 " with optional number of seconds to test a new test will be performed\n"
00678 " as the chart is being displayed.\n"
00679 " 2. 'core show translation paths [codec]'\n"
00680 " This will display all the translation paths associated with a codec\n";
00681 return NULL;
00682 case CLI_GENERATE:
00683 if (a->pos == 3) {
00684 return ast_cli_complete(a->word, option1, a->n);
00685 }
00686 if (a->pos == 4 && !strcasecmp(a->argv[3], option1[1])) {
00687 return complete_trans_path_choice(a->line, a->word, a->pos, a->n);
00688 }
00689 return NULL;
00690 }
00691
00692 if (a->argc > 5)
00693 return CLI_SHOWUSAGE;
00694
00695 if (a->argv[3] && !strcasecmp(a->argv[3], option1[1]) && a->argc == 5) {
00696 format_t input_src = 0;
00697 format_t src = 0;
00698 size_t len = 0;
00699 int dst;
00700 int i;
00701 const struct ast_format_list *format_list = ast_get_format_list(&len);
00702 struct ast_str *str = ast_str_alloca(256);
00703 struct ast_translator *step;
00704
00705 for (i = 0; i < len; i++) {
00706 if (!(format_list[i].bits & AST_FORMAT_AUDIO_MASK)) {
00707 continue;
00708 }
00709 if (!strncasecmp(format_list[i].name, a->argv[4], strlen(format_list[i].name))) {
00710 input_src = format_list[i].bits;
00711 }
00712 }
00713
00714 if (!input_src) {
00715 ast_cli(a->fd, "Source codec \"%s\" is not found.\n", a->argv[4]);
00716 return CLI_FAILURE;
00717 }
00718
00719 AST_RWLIST_RDLOCK(&translators);
00720 ast_cli(a->fd, "--- Translation paths SRC Codec \"%s\" sample rate %d ---\n", a->argv[4], ast_format_rate(input_src));
00721 for (i = 0; i < len; i++) {
00722 if (!(format_list[i].bits & AST_FORMAT_AUDIO_MASK) || (format_list[i].bits == input_src)) {
00723 continue;
00724 }
00725
00726
00727
00728
00729
00730 dst = powerof(format_list[i].bits);
00731 src = powerof(input_src);
00732 ast_str_reset(str);
00733 if (tr_matrix[src][dst].step) {
00734 ast_str_append(&str, 0, "%s", ast_getformatname(1LL << tr_matrix[src][dst].step->srcfmt));
00735 while (src != dst) {
00736 step = tr_matrix[src][dst].step;
00737 if (!step) {
00738 ast_str_reset(str);
00739 break;
00740 }
00741 ast_str_append(&str, 0, "->%s", ast_getformatname(1LL << step->dstfmt));
00742 src = step->dstfmt;
00743 }
00744 }
00745
00746 if (ast_strlen_zero(ast_str_buffer(str))) {
00747 ast_str_set(&str, 0, "No Translation Path");
00748 }
00749
00750 ast_cli(a->fd, "\t%-10.10s To %-10.10s: %-60.60s\n", a->argv[4], format_list[i].name, ast_str_buffer(str));
00751 }
00752 AST_RWLIST_UNLOCK(&translators);
00753
00754 return CLI_SUCCESS;
00755 } else if (a->argv[3] && !strcasecmp(a->argv[3], "recalc")) {
00756 z = a->argv[4] ? atoi(a->argv[4]) : 1;
00757
00758 if (z <= 0) {
00759 ast_cli(a->fd, " Recalc must be greater than 0. Defaulting to 1.\n");
00760 z = 1;
00761 }
00762
00763 if (z > MAX_RECALC) {
00764 ast_cli(a->fd, " Maximum limit of recalc exceeded by %d, truncating value to %d\n", z - MAX_RECALC, MAX_RECALC);
00765 z = MAX_RECALC;
00766 }
00767 ast_cli(a->fd, " Recalculating Codec Translation (number of sample seconds: %d)\n\n", z);
00768 AST_RWLIST_WRLOCK(&translators);
00769 rebuild_matrix(z);
00770 AST_RWLIST_UNLOCK(&translators);
00771 } else if (a->argc > 3)
00772 return CLI_SHOWUSAGE;
00773
00774 AST_RWLIST_RDLOCK(&translators);
00775
00776 ast_cli(a->fd, " Translation times between formats (in microseconds) for one second of data\n");
00777 ast_cli(a->fd, " Source Format (Rows) Destination Format (Columns)\n\n");
00778
00779 for (x = 0; x < SHOW_TRANS; x++) {
00780
00781 if (!(AST_FORMAT_AUDIO_MASK & (1LL << (x))))
00782 continue;
00783 curlen = strlen(ast_getformatname(1LL << (x)));
00784 if (curlen > longest)
00785 longest = curlen;
00786 for (y = 0; y < SHOW_TRANS; y++) {
00787 if (!(AST_FORMAT_AUDIO_MASK & (1LL << (y))))
00788 continue;
00789 if (tr_matrix[x][y].cost > pow(10, magnitude[x])) {
00790 magnitude[y] = floor(log10(tr_matrix[x][y].cost));
00791 }
00792 }
00793 }
00794 for (x = -1; x < SHOW_TRANS; x++) {
00795 struct ast_str *out = ast_str_alloca(256);
00796
00797 if (x >= 0 && !(AST_FORMAT_AUDIO_MASK & (1LL << (x))))
00798 continue;
00799
00800 if(x >= 0 && !strcmp(ast_getformatname(1LL << (x)), "unknown"))
00801 continue;
00802 ast_str_set(&out, -1, " ");
00803 for (y = -1; y < SHOW_TRANS; y++) {
00804
00805 if (y >= 0 && !(AST_FORMAT_AUDIO_MASK & (1LL << (y))))
00806 continue;
00807
00808 if (y >= 0 && !strcmp(ast_getformatname(1LL << (y)), "unknown"))
00809 continue;
00810 if (y >= 0)
00811 curlen = strlen(ast_getformatname(1LL << (y)));
00812 if (y >= 0 && magnitude[y] + 1 > curlen) {
00813 curlen = magnitude[y] + 1;
00814 }
00815 if (curlen < 5)
00816 curlen = 5;
00817 if (x >= 0 && y >= 0 && tr_matrix[x][y].step) {
00818
00819 ast_str_append(&out, -1, "%*d", curlen + 1, tr_matrix[x][y].cost);
00820 } else if (x == -1 && y >= 0) {
00821
00822 ast_str_append(&out, -1, "%*s", curlen + 1, ast_getformatname(1LL << (y)) );
00823 } else if (y == -1 && x >= 0) {
00824
00825 ast_str_append(&out, -1, "%*s", longest, ast_getformatname(1LL << (x)) );
00826 } else if (x >= 0 && y >= 0) {
00827
00828 ast_str_append(&out, -1, "%*s", curlen + 1, "-");
00829 } else {
00830
00831 ast_str_append(&out, -1, "%*s", longest, "");
00832 }
00833 }
00834 ast_str_append(&out, -1, "\n");
00835 ast_cli(a->fd, "%s", ast_str_buffer(out));
00836 }
00837 AST_RWLIST_UNLOCK(&translators);
00838 return CLI_SUCCESS;
00839 }
00840
00841 static struct ast_cli_entry cli_translate[] = {
00842 AST_CLI_DEFINE(handle_cli_core_show_translation, "Display translation matrix")
00843 };
00844
00845
00846 int __ast_register_translator(struct ast_translator *t, struct ast_module *mod)
00847 {
00848 static int added_cli = 0;
00849 struct ast_translator *u;
00850 char tmp[80];
00851
00852 if (!mod) {
00853 ast_log(LOG_WARNING, "Missing module pointer, you need to supply one\n");
00854 return -1;
00855 }
00856
00857 if (!t->buf_size) {
00858 ast_log(LOG_WARNING, "empty buf size, you need to supply one\n");
00859 return -1;
00860 }
00861
00862 t->module = mod;
00863
00864 t->srcfmt = powerof(t->srcfmt);
00865 t->dstfmt = powerof(t->dstfmt);
00866 t->active = 1;
00867
00868 if (t->srcfmt == -1 || t->dstfmt == -1) {
00869 ast_log(LOG_WARNING, "Invalid translator path: (%s codec is not valid)\n", t->srcfmt == -1 ? "starting" : "ending");
00870 return -1;
00871 }
00872 if (t->srcfmt >= MAX_FORMAT) {
00873 ast_log(LOG_WARNING, "Source format %s is larger than MAX_FORMAT\n", ast_getformatname(t->srcfmt));
00874 return -1;
00875 }
00876
00877 if (t->dstfmt >= MAX_FORMAT) {
00878 ast_log(LOG_WARNING, "Destination format %s is larger than MAX_FORMAT\n", ast_getformatname(t->dstfmt));
00879 return -1;
00880 }
00881
00882 if (t->buf_size) {
00883
00884
00885
00886
00887 struct _test_align { void *a, *b; } p;
00888 int align = (char *)&p.b - (char *)&p.a;
00889
00890 t->buf_size = ((t->buf_size + align - 1) / align) * align;
00891 }
00892
00893 if (t->frameout == NULL)
00894 t->frameout = default_frameout;
00895
00896 calc_cost(t, 1);
00897
00898 ast_verb(2, "Registered translator '%s' from format %s to %s, cost %d\n",
00899 term_color(tmp, t->name, COLOR_MAGENTA, COLOR_BLACK, sizeof(tmp)),
00900 ast_getformatname(1LL << t->srcfmt), ast_getformatname(1LL << t->dstfmt), t->cost);
00901
00902 if (!added_cli) {
00903 ast_cli_register_multiple(cli_translate, ARRAY_LEN(cli_translate));
00904 added_cli++;
00905 }
00906
00907 AST_RWLIST_WRLOCK(&translators);
00908
00909
00910
00911 AST_RWLIST_TRAVERSE_SAFE_BEGIN(&translators, u, list) {
00912 if ((u->srcfmt == t->srcfmt) &&
00913 (u->dstfmt == t->dstfmt) &&
00914 (u->cost > t->cost)) {
00915 AST_RWLIST_INSERT_BEFORE_CURRENT(t, list);
00916 t = NULL;
00917 break;
00918 }
00919 }
00920 AST_RWLIST_TRAVERSE_SAFE_END;
00921
00922
00923
00924 if (t)
00925 AST_RWLIST_INSERT_HEAD(&translators, t, list);
00926
00927 rebuild_matrix(0);
00928
00929 AST_RWLIST_UNLOCK(&translators);
00930
00931 return 0;
00932 }
00933
00934
00935 int ast_unregister_translator(struct ast_translator *t)
00936 {
00937 char tmp[80];
00938 struct ast_translator *u;
00939 int found = 0;
00940
00941 AST_RWLIST_WRLOCK(&translators);
00942 AST_RWLIST_TRAVERSE_SAFE_BEGIN(&translators, u, list) {
00943 if (u == t) {
00944 AST_RWLIST_REMOVE_CURRENT(list);
00945 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(1LL << t->srcfmt), ast_getformatname(1LL << t->dstfmt));
00946 found = 1;
00947 break;
00948 }
00949 }
00950 AST_RWLIST_TRAVERSE_SAFE_END;
00951
00952 if (found)
00953 rebuild_matrix(0);
00954
00955 AST_RWLIST_UNLOCK(&translators);
00956
00957 return (u ? 0 : -1);
00958 }
00959
00960 void ast_translator_activate(struct ast_translator *t)
00961 {
00962 AST_RWLIST_WRLOCK(&translators);
00963 t->active = 1;
00964 rebuild_matrix(0);
00965 AST_RWLIST_UNLOCK(&translators);
00966 }
00967
00968 void ast_translator_deactivate(struct ast_translator *t)
00969 {
00970 AST_RWLIST_WRLOCK(&translators);
00971 t->active = 0;
00972 rebuild_matrix(0);
00973 AST_RWLIST_UNLOCK(&translators);
00974 }
00975
00976
00977 format_t ast_translator_best_choice(format_t *dst, format_t *srcs)
00978 {
00979 int x,y;
00980 int better = 0;
00981 int besttime = INT_MAX;
00982 int beststeps = INT_MAX;
00983 unsigned int best_rate_change = INT_MAX;
00984 format_t best = -1;
00985 format_t bestdst = 0;
00986 format_t cur, cursrc;
00987 format_t common = ((*dst) & (*srcs)) & AST_FORMAT_AUDIO_MASK;
00988
00989 if (common) {
00990 for (cur = 1, y = 0; y <= MAX_AUDIO_FORMAT; cur <<= 1, y++) {
00991 if (!(cur & common)) {
00992 continue;
00993 }
00994
00995
00996 if (best == -1) {
00997 best = cur;
00998 continue;
00999 }
01000
01001 if (ast_format_rate(best) < ast_format_rate(cur)) {
01002 best = cur;
01003 continue;
01004 }
01005 }
01006
01007 *srcs = *dst = best;
01008 return 0;
01009 } else {
01010 AST_RWLIST_RDLOCK(&translators);
01011 for (cur = 1, y = 0; y <= MAX_AUDIO_FORMAT; cur <<= 1, y++) {
01012 if (! (cur & *dst)) {
01013 continue;
01014 }
01015 for (cursrc = 1, x = 0; x <= MAX_AUDIO_FORMAT; cursrc <<= 1, x++) {
01016 if (!(*srcs & cursrc) || !tr_matrix[x][y].step) {
01017 continue;
01018 }
01019
01020
01021
01022
01023
01024 better = 0;
01025 if (tr_matrix[x][y].rate_change < best_rate_change) {
01026 better = 1;
01027 }
01028 if ((tr_matrix[x][y].rate_change <= best_rate_change) &&
01029 (tr_matrix[x][y].cost < besttime || tr_matrix[x][y].multistep < beststeps)) {
01030 better = 1;
01031 }
01032 if (better) {
01033
01034 best = cursrc;
01035 bestdst = cur;
01036 besttime = tr_matrix[x][y].cost;
01037 beststeps = tr_matrix[x][y].multistep;
01038 best_rate_change = tr_matrix[x][y].rate_change;
01039 }
01040 }
01041 }
01042 AST_RWLIST_UNLOCK(&translators);
01043 if (best > -1) {
01044 *srcs = best;
01045 *dst = bestdst;
01046 best = 0;
01047 }
01048 return best;
01049 }
01050 }
01051
01052 unsigned int ast_translate_path_steps(format_t dest, format_t src)
01053 {
01054 unsigned int res = -1;
01055
01056
01057 src = powerof(src);
01058 dest = powerof(dest);
01059
01060 if (src == -1 || dest == -1) {
01061 ast_log(LOG_WARNING, "No translator path: (%s codec is not valid)\n", src == -1 ? "starting" : "ending");
01062 return -1;
01063 }
01064 AST_RWLIST_RDLOCK(&translators);
01065
01066 if (tr_matrix[src][dest].step)
01067 res = tr_matrix[src][dest].multistep + 1;
01068
01069 AST_RWLIST_UNLOCK(&translators);
01070
01071 return res;
01072 }
01073
01074 format_t ast_translate_available_formats(format_t dest, format_t src)
01075 {
01076 format_t res = dest;
01077 format_t x;
01078 format_t src_audio = src & AST_FORMAT_AUDIO_MASK;
01079 format_t src_video = src & AST_FORMAT_VIDEO_MASK;
01080 format_t x_bits;
01081
01082
01083
01084 if (!src)
01085 return dest;
01086
01087
01088 if (src_audio) {
01089 src_audio = powerof(src_audio);
01090 }
01091
01092
01093 if (src_video) {
01094 src_video = powerof(src_video);
01095 }
01096
01097
01098
01099
01100
01101
01102 AST_RWLIST_RDLOCK(&translators);
01103
01104
01105
01106
01107
01108 for (x = 1LL; src_audio && x > 0; x <<= 1) {
01109 if (!(x & AST_FORMAT_AUDIO_MASK)) {
01110 continue;
01111 }
01112
01113
01114 if (!(dest & x))
01115 continue;
01116
01117
01118
01119 if (src & x)
01120 continue;
01121
01122
01123
01124
01125 x_bits = powerof(x);
01126 if (!tr_matrix[src_audio][x_bits].step) {
01127 res &= ~x;
01128 continue;
01129 }
01130
01131
01132 if (!tr_matrix[x_bits][src_audio].step)
01133 res &= ~x;
01134 }
01135
01136
01137
01138
01139
01140 for (x = 1LL; src_video && x > 0; x <<= 1) {
01141 if (!(x & AST_FORMAT_VIDEO_MASK)) {
01142 continue;
01143 }
01144
01145
01146 if (!(dest & x))
01147 continue;
01148
01149
01150
01151 if (src & x)
01152 continue;
01153
01154
01155
01156
01157 x_bits = powerof(x);
01158 if (!tr_matrix[src_video][x_bits].step) {
01159 res &= ~x;
01160 continue;
01161 }
01162
01163
01164 if (!tr_matrix[x_bits][src_video].step)
01165 res &= ~x;
01166 }
01167
01168 AST_RWLIST_UNLOCK(&translators);
01169
01170 return res;
01171 }