2009-01-05 12:41:40 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2005 Alex Beregszaszi
|
|
|
|
*
|
2015-04-13 07:36:54 +00:00
|
|
|
* This file is part of mpv.
|
2009-01-05 12:41:40 +00:00
|
|
|
*
|
2017-06-20 13:36:49 +00:00
|
|
|
* mpv is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
2009-01-05 12:41:40 +00:00
|
|
|
*
|
2015-04-13 07:36:54 +00:00
|
|
|
* mpv is distributed in the hope that it will be useful,
|
2009-01-05 12:41:40 +00:00
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
2017-06-20 13:36:49 +00:00
|
|
|
* GNU Lesser General Public License for more details.
|
2009-01-05 12:41:40 +00:00
|
|
|
*
|
2017-06-20 13:36:49 +00:00
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with mpv. If not, see <http://www.gnu.org/licenses/>.
|
2009-01-05 12:41:40 +00:00
|
|
|
*/
|
2005-07-27 11:09:42 +00:00
|
|
|
|
2005-02-21 16:41:15 +00:00
|
|
|
#include <limits.h>
|
|
|
|
|
2013-12-17 01:39:45 +00:00
|
|
|
#include "common/common.h"
|
2017-09-21 10:48:30 +00:00
|
|
|
#include "format.h"
|
2005-02-21 16:41:15 +00:00
|
|
|
|
2015-06-26 21:06:37 +00:00
|
|
|
// number of bytes per sample, 0 if invalid/unknown
|
|
|
|
int af_fmt_to_bytes(int format)
|
2005-02-21 16:41:15 +00:00
|
|
|
{
|
2015-06-26 21:05:16 +00:00
|
|
|
switch (af_fmt_from_planar(format)) {
|
|
|
|
case AF_FORMAT_U8: return 1;
|
|
|
|
case AF_FORMAT_S16: return 2;
|
|
|
|
case AF_FORMAT_S32: return 4;
|
2019-09-27 19:31:04 +00:00
|
|
|
case AF_FORMAT_S64: return 8;
|
2015-06-26 21:05:16 +00:00
|
|
|
case AF_FORMAT_FLOAT: return 4;
|
|
|
|
case AF_FORMAT_DOUBLE: return 8;
|
2005-02-21 16:41:15 +00:00
|
|
|
}
|
2015-06-26 21:05:16 +00:00
|
|
|
if (af_fmt_is_spdif(format))
|
|
|
|
return 2;
|
2013-05-10 13:04:21 +00:00
|
|
|
return 0;
|
2005-02-21 16:41:15 +00:00
|
|
|
}
|
|
|
|
|
2015-06-16 18:57:43 +00:00
|
|
|
// All formats are considered signed, except explicitly unsigned int formats.
|
2015-06-26 21:06:37 +00:00
|
|
|
bool af_fmt_is_unsigned(int format)
|
2015-06-16 18:57:43 +00:00
|
|
|
{
|
|
|
|
return format == AF_FORMAT_U8 || format == AF_FORMAT_U8P;
|
|
|
|
}
|
|
|
|
|
2015-06-26 21:05:16 +00:00
|
|
|
bool af_fmt_is_float(int format)
|
|
|
|
{
|
|
|
|
format = af_fmt_from_planar(format);
|
|
|
|
return format == AF_FORMAT_FLOAT || format == AF_FORMAT_DOUBLE;
|
|
|
|
}
|
|
|
|
|
|
|
|
// true for both unsigned and signed ints
|
|
|
|
bool af_fmt_is_int(int format)
|
|
|
|
{
|
|
|
|
return format && !af_fmt_is_spdif(format) && !af_fmt_is_float(format);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool af_fmt_is_spdif(int format)
|
|
|
|
{
|
|
|
|
return af_format_sample_alignment(format) > 1;
|
|
|
|
}
|
|
|
|
|
2015-06-26 21:06:37 +00:00
|
|
|
bool af_fmt_is_pcm(int format)
|
|
|
|
{
|
|
|
|
return af_fmt_is_valid(format) && !af_fmt_is_spdif(format);
|
|
|
|
}
|
|
|
|
|
2013-11-10 22:10:16 +00:00
|
|
|
static const int planar_formats[][2] = {
|
|
|
|
{AF_FORMAT_U8P, AF_FORMAT_U8},
|
|
|
|
{AF_FORMAT_S16P, AF_FORMAT_S16},
|
|
|
|
{AF_FORMAT_S32P, AF_FORMAT_S32},
|
2019-09-27 19:21:34 +00:00
|
|
|
{AF_FORMAT_S64P, AF_FORMAT_S64},
|
2013-11-10 22:10:16 +00:00
|
|
|
{AF_FORMAT_FLOATP, AF_FORMAT_FLOAT},
|
|
|
|
{AF_FORMAT_DOUBLEP, AF_FORMAT_DOUBLE},
|
|
|
|
};
|
|
|
|
|
2018-08-09 08:19:10 +00:00
|
|
|
bool af_fmt_is_planar(int format)
|
|
|
|
{
|
|
|
|
for (int n = 0; n < MP_ARRAY_SIZE(planar_formats); n++) {
|
|
|
|
if (planar_formats[n][0] == format)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2013-11-10 22:10:16 +00:00
|
|
|
// Return the planar format corresponding to the given format.
|
2018-08-09 08:19:10 +00:00
|
|
|
// If the format is already planar or if there's no equivalent,
|
|
|
|
// return it.
|
2013-11-10 22:10:16 +00:00
|
|
|
int af_fmt_to_planar(int format)
|
|
|
|
{
|
|
|
|
for (int n = 0; n < MP_ARRAY_SIZE(planar_formats); n++) {
|
|
|
|
if (planar_formats[n][1] == format)
|
|
|
|
return planar_formats[n][0];
|
|
|
|
}
|
2018-08-09 08:19:10 +00:00
|
|
|
return format;
|
2013-11-10 22:10:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Return the interleaved format corresponding to the given format.
|
2018-08-09 08:19:10 +00:00
|
|
|
// If the format is already interleaved or if there's no equivalent,
|
|
|
|
// return it.
|
2013-11-10 22:10:16 +00:00
|
|
|
int af_fmt_from_planar(int format)
|
|
|
|
{
|
|
|
|
for (int n = 0; n < MP_ARRAY_SIZE(planar_formats); n++) {
|
|
|
|
if (planar_formats[n][0] == format)
|
|
|
|
return planar_formats[n][1];
|
|
|
|
}
|
2018-08-09 08:19:10 +00:00
|
|
|
return format;
|
2013-11-10 22:10:16 +00:00
|
|
|
}
|
|
|
|
|
2013-10-21 23:01:41 +00:00
|
|
|
bool af_fmt_is_valid(int format)
|
|
|
|
{
|
2015-06-26 21:05:16 +00:00
|
|
|
return format > 0 && format < AF_FORMAT_COUNT;
|
2013-10-21 23:01:41 +00:00
|
|
|
}
|
|
|
|
|
2013-11-07 21:12:36 +00:00
|
|
|
const char *af_fmt_to_str(int format)
|
2005-02-21 16:41:15 +00:00
|
|
|
{
|
2015-06-26 21:06:21 +00:00
|
|
|
switch (format) {
|
|
|
|
case AF_FORMAT_U8: return "u8";
|
|
|
|
case AF_FORMAT_S16: return "s16";
|
|
|
|
case AF_FORMAT_S32: return "s32";
|
2019-09-27 19:21:34 +00:00
|
|
|
case AF_FORMAT_S64: return "s64";
|
2015-06-26 21:06:21 +00:00
|
|
|
case AF_FORMAT_FLOAT: return "float";
|
|
|
|
case AF_FORMAT_DOUBLE: return "double";
|
|
|
|
case AF_FORMAT_U8P: return "u8p";
|
|
|
|
case AF_FORMAT_S16P: return "s16p";
|
|
|
|
case AF_FORMAT_S32P: return "s32p";
|
2019-09-27 19:21:34 +00:00
|
|
|
case AF_FORMAT_S64P: return "s64p";
|
2015-06-26 21:06:21 +00:00
|
|
|
case AF_FORMAT_FLOATP: return "floatp";
|
|
|
|
case AF_FORMAT_DOUBLEP: return "doublep";
|
|
|
|
case AF_FORMAT_S_AAC: return "spdif-aac";
|
|
|
|
case AF_FORMAT_S_AC3: return "spdif-ac3";
|
|
|
|
case AF_FORMAT_S_DTS: return "spdif-dts";
|
|
|
|
case AF_FORMAT_S_DTSHD: return "spdif-dtshd";
|
|
|
|
case AF_FORMAT_S_EAC3: return "spdif-eac3";
|
|
|
|
case AF_FORMAT_S_MP3: return "spdif-mp3";
|
|
|
|
case AF_FORMAT_S_TRUEHD: return "spdif-truehd";
|
2013-11-07 21:12:26 +00:00
|
|
|
}
|
2005-02-21 16:41:15 +00:00
|
|
|
return "??";
|
|
|
|
}
|
|
|
|
|
2013-11-10 22:05:51 +00:00
|
|
|
void af_fill_silence(void *dst, size_t bytes, int format)
|
|
|
|
{
|
2015-06-26 21:06:37 +00:00
|
|
|
memset(dst, af_fmt_is_unsigned(format) ? 0x80 : 0, bytes);
|
2013-11-10 22:05:51 +00:00
|
|
|
}
|
audio/format: add heuristic to estimate loss on format conversion
The added function af_format_conversion_score() can be used to select
the best sample format to convert to in order to reduce loss and extra
conversion work.
It calculates a "loss" score when going from one format to another, and
for each conversion that needs to be done a certain score is subtracted.
Thus, if you have to convert from one format to a set of other formats,
you can calculate the score for each conversion, and pick the one with
the highest score.
Conversion between int and float is considered the worst case. One odd
consequence is that when converting from s32 to u8 or float, u8 will be
picked.
Test program used to develop this follows:
#define MAX_FMT 200
struct entry {
const char *name;
int score;
};
static int compentry(const void *px1, const void *px2)
{
const struct entry *x1 = px1;
const struct entry *x2 = px2;
if (x1->score > x2->score)
return 1;
if (x1->score < x2->score)
return -1;
return 0;
}
int main(int argc, char *argv[])
{
for (int n = 0; af_fmtstr_table[n].name; n++) {
struct entry entry[MAX_FMT];
int entries = 0;
for (int i = 0; af_fmtstr_table[i].name; i++) {
assert(i < MAX_FMT);
entry[entries].name = af_fmtstr_table[i].name;
entry[entries].score =
af_format_conversion_score(af_fmtstr_table[i].format,
af_fmtstr_table[n].format);
entries++;
}
qsort(&entry[0], entries, sizeof(entry[0]), compentry);
for (int i = 0; i < entries; i++) {
printf("%s -> %s: %d \n", af_fmtstr_table[n].name,
entry[i].name, entry[i].score);
}
}
}
2013-11-16 19:18:39 +00:00
|
|
|
|
|
|
|
// Returns a "score" that serves as heuristic how lossy or hard a conversion is.
|
|
|
|
// If the formats are equal, 1024 is returned. If they are gravely incompatible
|
|
|
|
// (like s16<->ac3), INT_MIN is returned. If there is implied loss of precision
|
|
|
|
// (like s16->s8), a value <0 is returned.
|
2018-01-18 13:44:20 +00:00
|
|
|
int af_format_conversion_score(int dst_format, int src_format)
|
audio/format: add heuristic to estimate loss on format conversion
The added function af_format_conversion_score() can be used to select
the best sample format to convert to in order to reduce loss and extra
conversion work.
It calculates a "loss" score when going from one format to another, and
for each conversion that needs to be done a certain score is subtracted.
Thus, if you have to convert from one format to a set of other formats,
you can calculate the score for each conversion, and pick the one with
the highest score.
Conversion between int and float is considered the worst case. One odd
consequence is that when converting from s32 to u8 or float, u8 will be
picked.
Test program used to develop this follows:
#define MAX_FMT 200
struct entry {
const char *name;
int score;
};
static int compentry(const void *px1, const void *px2)
{
const struct entry *x1 = px1;
const struct entry *x2 = px2;
if (x1->score > x2->score)
return 1;
if (x1->score < x2->score)
return -1;
return 0;
}
int main(int argc, char *argv[])
{
for (int n = 0; af_fmtstr_table[n].name; n++) {
struct entry entry[MAX_FMT];
int entries = 0;
for (int i = 0; af_fmtstr_table[i].name; i++) {
assert(i < MAX_FMT);
entry[entries].name = af_fmtstr_table[i].name;
entry[entries].score =
af_format_conversion_score(af_fmtstr_table[i].format,
af_fmtstr_table[n].format);
entries++;
}
qsort(&entry[0], entries, sizeof(entry[0]), compentry);
for (int i = 0; i < entries; i++) {
printf("%s -> %s: %d \n", af_fmtstr_table[n].name,
entry[i].name, entry[i].score);
}
}
}
2013-11-16 19:18:39 +00:00
|
|
|
{
|
|
|
|
if (dst_format == AF_FORMAT_UNKNOWN || src_format == AF_FORMAT_UNKNOWN)
|
|
|
|
return INT_MIN;
|
|
|
|
if (dst_format == src_format)
|
|
|
|
return 1024;
|
|
|
|
// Can't be normally converted
|
2015-06-26 21:06:37 +00:00
|
|
|
if (!af_fmt_is_pcm(dst_format) || !af_fmt_is_pcm(src_format))
|
audio/format: add heuristic to estimate loss on format conversion
The added function af_format_conversion_score() can be used to select
the best sample format to convert to in order to reduce loss and extra
conversion work.
It calculates a "loss" score when going from one format to another, and
for each conversion that needs to be done a certain score is subtracted.
Thus, if you have to convert from one format to a set of other formats,
you can calculate the score for each conversion, and pick the one with
the highest score.
Conversion between int and float is considered the worst case. One odd
consequence is that when converting from s32 to u8 or float, u8 will be
picked.
Test program used to develop this follows:
#define MAX_FMT 200
struct entry {
const char *name;
int score;
};
static int compentry(const void *px1, const void *px2)
{
const struct entry *x1 = px1;
const struct entry *x2 = px2;
if (x1->score > x2->score)
return 1;
if (x1->score < x2->score)
return -1;
return 0;
}
int main(int argc, char *argv[])
{
for (int n = 0; af_fmtstr_table[n].name; n++) {
struct entry entry[MAX_FMT];
int entries = 0;
for (int i = 0; af_fmtstr_table[i].name; i++) {
assert(i < MAX_FMT);
entry[entries].name = af_fmtstr_table[i].name;
entry[entries].score =
af_format_conversion_score(af_fmtstr_table[i].format,
af_fmtstr_table[n].format);
entries++;
}
qsort(&entry[0], entries, sizeof(entry[0]), compentry);
for (int i = 0; i < entries; i++) {
printf("%s -> %s: %d \n", af_fmtstr_table[n].name,
entry[i].name, entry[i].score);
}
}
}
2013-11-16 19:18:39 +00:00
|
|
|
return INT_MIN;
|
|
|
|
int score = 1024;
|
2015-06-26 21:05:16 +00:00
|
|
|
if (af_fmt_is_planar(dst_format) != af_fmt_is_planar(src_format))
|
audio/format: add heuristic to estimate loss on format conversion
The added function af_format_conversion_score() can be used to select
the best sample format to convert to in order to reduce loss and extra
conversion work.
It calculates a "loss" score when going from one format to another, and
for each conversion that needs to be done a certain score is subtracted.
Thus, if you have to convert from one format to a set of other formats,
you can calculate the score for each conversion, and pick the one with
the highest score.
Conversion between int and float is considered the worst case. One odd
consequence is that when converting from s32 to u8 or float, u8 will be
picked.
Test program used to develop this follows:
#define MAX_FMT 200
struct entry {
const char *name;
int score;
};
static int compentry(const void *px1, const void *px2)
{
const struct entry *x1 = px1;
const struct entry *x2 = px2;
if (x1->score > x2->score)
return 1;
if (x1->score < x2->score)
return -1;
return 0;
}
int main(int argc, char *argv[])
{
for (int n = 0; af_fmtstr_table[n].name; n++) {
struct entry entry[MAX_FMT];
int entries = 0;
for (int i = 0; af_fmtstr_table[i].name; i++) {
assert(i < MAX_FMT);
entry[entries].name = af_fmtstr_table[i].name;
entry[entries].score =
af_format_conversion_score(af_fmtstr_table[i].format,
af_fmtstr_table[n].format);
entries++;
}
qsort(&entry[0], entries, sizeof(entry[0]), compentry);
for (int i = 0; i < entries; i++) {
printf("%s -> %s: %d \n", af_fmtstr_table[n].name,
entry[i].name, entry[i].score);
}
}
}
2013-11-16 19:18:39 +00:00
|
|
|
score -= 1; // has to (de-)planarize
|
2015-06-26 21:05:16 +00:00
|
|
|
if (af_fmt_is_float(dst_format) != af_fmt_is_float(src_format)) {
|
2015-06-26 21:06:37 +00:00
|
|
|
int dst_bytes = af_fmt_to_bytes(dst_format);
|
2015-06-26 21:05:16 +00:00
|
|
|
if (af_fmt_is_float(dst_format)) {
|
2015-09-11 03:52:04 +00:00
|
|
|
// For int->float, consider a lower bound on the precision difference.
|
|
|
|
int bytes = (dst_bytes == 4 ? 3 : 6) - af_fmt_to_bytes(src_format);
|
|
|
|
if (bytes >= 0) {
|
|
|
|
score -= 8 * bytes; // excess precision
|
|
|
|
} else {
|
|
|
|
score += 1024 * (bytes - 1); // precision is lost (i.e. s32 -> float)
|
|
|
|
}
|
audio/format: add heuristic to estimate loss on format conversion
The added function af_format_conversion_score() can be used to select
the best sample format to convert to in order to reduce loss and extra
conversion work.
It calculates a "loss" score when going from one format to another, and
for each conversion that needs to be done a certain score is subtracted.
Thus, if you have to convert from one format to a set of other formats,
you can calculate the score for each conversion, and pick the one with
the highest score.
Conversion between int and float is considered the worst case. One odd
consequence is that when converting from s32 to u8 or float, u8 will be
picked.
Test program used to develop this follows:
#define MAX_FMT 200
struct entry {
const char *name;
int score;
};
static int compentry(const void *px1, const void *px2)
{
const struct entry *x1 = px1;
const struct entry *x2 = px2;
if (x1->score > x2->score)
return 1;
if (x1->score < x2->score)
return -1;
return 0;
}
int main(int argc, char *argv[])
{
for (int n = 0; af_fmtstr_table[n].name; n++) {
struct entry entry[MAX_FMT];
int entries = 0;
for (int i = 0; af_fmtstr_table[i].name; i++) {
assert(i < MAX_FMT);
entry[entries].name = af_fmtstr_table[i].name;
entry[entries].score =
af_format_conversion_score(af_fmtstr_table[i].format,
af_fmtstr_table[n].format);
entries++;
}
qsort(&entry[0], entries, sizeof(entry[0]), compentry);
for (int i = 0; i < entries; i++) {
printf("%s -> %s: %d \n", af_fmtstr_table[n].name,
entry[i].name, entry[i].score);
}
}
}
2013-11-16 19:18:39 +00:00
|
|
|
} else {
|
2015-09-11 03:52:04 +00:00
|
|
|
// float->int is the worst case. Penalize heavily and
|
|
|
|
// prefer highest bit depth int.
|
|
|
|
score -= 1048576 * (8 - dst_bytes);
|
audio/format: add heuristic to estimate loss on format conversion
The added function af_format_conversion_score() can be used to select
the best sample format to convert to in order to reduce loss and extra
conversion work.
It calculates a "loss" score when going from one format to another, and
for each conversion that needs to be done a certain score is subtracted.
Thus, if you have to convert from one format to a set of other formats,
you can calculate the score for each conversion, and pick the one with
the highest score.
Conversion between int and float is considered the worst case. One odd
consequence is that when converting from s32 to u8 or float, u8 will be
picked.
Test program used to develop this follows:
#define MAX_FMT 200
struct entry {
const char *name;
int score;
};
static int compentry(const void *px1, const void *px2)
{
const struct entry *x1 = px1;
const struct entry *x2 = px2;
if (x1->score > x2->score)
return 1;
if (x1->score < x2->score)
return -1;
return 0;
}
int main(int argc, char *argv[])
{
for (int n = 0; af_fmtstr_table[n].name; n++) {
struct entry entry[MAX_FMT];
int entries = 0;
for (int i = 0; af_fmtstr_table[i].name; i++) {
assert(i < MAX_FMT);
entry[entries].name = af_fmtstr_table[i].name;
entry[entries].score =
af_format_conversion_score(af_fmtstr_table[i].format,
af_fmtstr_table[n].format);
entries++;
}
qsort(&entry[0], entries, sizeof(entry[0]), compentry);
for (int i = 0; i < entries; i++) {
printf("%s -> %s: %d \n", af_fmtstr_table[n].name,
entry[i].name, entry[i].score);
}
}
}
2013-11-16 19:18:39 +00:00
|
|
|
}
|
2015-09-11 03:52:04 +00:00
|
|
|
score -= 512; // penalty for any float <-> int conversion
|
audio/format: add heuristic to estimate loss on format conversion
The added function af_format_conversion_score() can be used to select
the best sample format to convert to in order to reduce loss and extra
conversion work.
It calculates a "loss" score when going from one format to another, and
for each conversion that needs to be done a certain score is subtracted.
Thus, if you have to convert from one format to a set of other formats,
you can calculate the score for each conversion, and pick the one with
the highest score.
Conversion between int and float is considered the worst case. One odd
consequence is that when converting from s32 to u8 or float, u8 will be
picked.
Test program used to develop this follows:
#define MAX_FMT 200
struct entry {
const char *name;
int score;
};
static int compentry(const void *px1, const void *px2)
{
const struct entry *x1 = px1;
const struct entry *x2 = px2;
if (x1->score > x2->score)
return 1;
if (x1->score < x2->score)
return -1;
return 0;
}
int main(int argc, char *argv[])
{
for (int n = 0; af_fmtstr_table[n].name; n++) {
struct entry entry[MAX_FMT];
int entries = 0;
for (int i = 0; af_fmtstr_table[i].name; i++) {
assert(i < MAX_FMT);
entry[entries].name = af_fmtstr_table[i].name;
entry[entries].score =
af_format_conversion_score(af_fmtstr_table[i].format,
af_fmtstr_table[n].format);
entries++;
}
qsort(&entry[0], entries, sizeof(entry[0]), compentry);
for (int i = 0; i < entries; i++) {
printf("%s -> %s: %d \n", af_fmtstr_table[n].name,
entry[i].name, entry[i].score);
}
}
}
2013-11-16 19:18:39 +00:00
|
|
|
} else {
|
2015-06-26 21:06:37 +00:00
|
|
|
int bytes = af_fmt_to_bytes(dst_format) - af_fmt_to_bytes(src_format);
|
|
|
|
if (bytes > 0) {
|
2015-09-11 03:52:04 +00:00
|
|
|
score -= 8 * bytes; // has to add padding
|
2015-06-26 21:06:37 +00:00
|
|
|
} else if (bytes < 0) {
|
2015-09-11 03:52:04 +00:00
|
|
|
score += 1024 * (bytes - 1); // has to reduce bit depth
|
audio/format: add heuristic to estimate loss on format conversion
The added function af_format_conversion_score() can be used to select
the best sample format to convert to in order to reduce loss and extra
conversion work.
It calculates a "loss" score when going from one format to another, and
for each conversion that needs to be done a certain score is subtracted.
Thus, if you have to convert from one format to a set of other formats,
you can calculate the score for each conversion, and pick the one with
the highest score.
Conversion between int and float is considered the worst case. One odd
consequence is that when converting from s32 to u8 or float, u8 will be
picked.
Test program used to develop this follows:
#define MAX_FMT 200
struct entry {
const char *name;
int score;
};
static int compentry(const void *px1, const void *px2)
{
const struct entry *x1 = px1;
const struct entry *x2 = px2;
if (x1->score > x2->score)
return 1;
if (x1->score < x2->score)
return -1;
return 0;
}
int main(int argc, char *argv[])
{
for (int n = 0; af_fmtstr_table[n].name; n++) {
struct entry entry[MAX_FMT];
int entries = 0;
for (int i = 0; af_fmtstr_table[i].name; i++) {
assert(i < MAX_FMT);
entry[entries].name = af_fmtstr_table[i].name;
entry[entries].score =
af_format_conversion_score(af_fmtstr_table[i].format,
af_fmtstr_table[n].format);
entries++;
}
qsort(&entry[0], entries, sizeof(entry[0]), compentry);
for (int i = 0; i < entries; i++) {
printf("%s -> %s: %d \n", af_fmtstr_table[n].name,
entry[i].name, entry[i].score);
}
}
}
2013-11-16 19:18:39 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return score;
|
|
|
|
}
|
2015-03-10 14:12:52 +00:00
|
|
|
|
2015-09-10 21:30:51 +00:00
|
|
|
struct entry {
|
|
|
|
int fmt;
|
|
|
|
int score;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int cmp_entry(const void *a, const void *b)
|
|
|
|
{
|
|
|
|
#define CMP_INT(a, b) (a > b ? 1 : (a < b ? -1 : 0))
|
|
|
|
return -CMP_INT(((struct entry *)a)->score, ((struct entry *)b)->score);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return a list of sample format compatible to src_format, sorted by order
|
|
|
|
// of preference. out_formats[0] will be src_format (as long as it's valid),
|
|
|
|
// and the list is terminated with 0 (AF_FORMAT_UNKNOWN).
|
|
|
|
// Keep in mind that this also returns formats with flipped interleaving
|
|
|
|
// (e.g. for s16, it returns [s16, s16p, ...]).
|
2018-01-23 23:02:13 +00:00
|
|
|
// out_formats must be an int[AF_FORMAT_COUNT + 1] array.
|
|
|
|
void af_get_best_sample_formats(int src_format, int *out_formats)
|
2015-09-10 21:30:51 +00:00
|
|
|
{
|
|
|
|
int num = 0;
|
2018-01-23 23:02:13 +00:00
|
|
|
struct entry e[AF_FORMAT_COUNT + 1];
|
2015-09-10 21:30:51 +00:00
|
|
|
for (int fmt = 1; fmt < AF_FORMAT_COUNT; fmt++) {
|
|
|
|
int score = af_format_conversion_score(fmt, src_format);
|
|
|
|
if (score > INT_MIN)
|
|
|
|
e[num++] = (struct entry){fmt, score};
|
|
|
|
}
|
|
|
|
qsort(e, num, sizeof(e[0]), cmp_entry);
|
|
|
|
for (int n = 0; n < num; n++)
|
|
|
|
out_formats[n] = e[n].fmt;
|
|
|
|
out_formats[num] = 0;
|
|
|
|
}
|
|
|
|
|
2016-03-17 06:37:46 +00:00
|
|
|
// Return the best match to src_samplerate from the list provided in the array
|
|
|
|
// *available, which must be terminated by 0, or itself NULL. If *available is
|
|
|
|
// empty or NULL, return a negative value. Exact match to src_samplerate is
|
|
|
|
// most preferred, followed by the lowest integer multiple, followed by the
|
|
|
|
// maximum of *available.
|
|
|
|
int af_select_best_samplerate(int src_samplerate, const int *available)
|
|
|
|
{
|
|
|
|
if (!available)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
int min_mult_rate = INT_MAX;
|
|
|
|
int max_rate = INT_MIN;
|
|
|
|
for (int i = 0; available[i]; i++) {
|
|
|
|
if (available[i] == src_samplerate)
|
|
|
|
return available[i];
|
|
|
|
|
|
|
|
if (!(available[i] % src_samplerate))
|
|
|
|
min_mult_rate = MPMIN(min_mult_rate, available[i]);
|
|
|
|
|
|
|
|
max_rate = MPMAX(max_rate, available[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (min_mult_rate < INT_MAX)
|
|
|
|
return min_mult_rate;
|
|
|
|
|
|
|
|
if (max_rate > INT_MIN)
|
|
|
|
return max_rate;
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2015-03-10 16:11:38 +00:00
|
|
|
// Return the number of samples that make up one frame in this format.
|
|
|
|
// You get the byte size by multiplying them with sample size and channel count.
|
2015-03-10 14:12:52 +00:00
|
|
|
int af_format_sample_alignment(int format)
|
|
|
|
{
|
|
|
|
switch (format) {
|
2015-03-10 16:11:38 +00:00
|
|
|
case AF_FORMAT_S_AAC: return 16384 / 4;
|
|
|
|
case AF_FORMAT_S_AC3: return 6144 / 4;
|
|
|
|
case AF_FORMAT_S_DTSHD: return 32768 / 16;
|
|
|
|
case AF_FORMAT_S_DTS: return 2048 / 4;
|
|
|
|
case AF_FORMAT_S_EAC3: return 24576 / 4;
|
|
|
|
case AF_FORMAT_S_MP3: return 4608 / 4;
|
|
|
|
case AF_FORMAT_S_TRUEHD: return 61440 / 16;
|
2015-03-10 14:12:52 +00:00
|
|
|
default: return 1;
|
|
|
|
}
|
|
|
|
}
|