2013-05-09 13:12:16 +00:00
|
|
|
/*
|
|
|
|
* This file is part of mpv.
|
|
|
|
*
|
|
|
|
* mpv is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* mpv is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License along
|
|
|
|
* with mpv. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <assert.h>
|
2014-12-28 08:38:22 +00:00
|
|
|
#include <limits.h>
|
2013-05-09 13:12:16 +00:00
|
|
|
|
2014-05-08 19:45:04 +00:00
|
|
|
#include "common/common.h"
|
2013-05-09 13:12:16 +00:00
|
|
|
#include "chmap_sel.h"
|
|
|
|
|
2014-06-10 21:56:05 +00:00
|
|
|
static const struct mp_chmap speaker_replacements[][2] = {
|
2014-05-08 19:45:04 +00:00
|
|
|
// 5.1 <-> 5.1 (side)
|
|
|
|
{ MP_CHMAP2(SL, SR), MP_CHMAP2(BL, BR) },
|
|
|
|
// 7.1 <-> 7.1 (rear ext)
|
|
|
|
{ MP_CHMAP2(SL, SR), MP_CHMAP2(SDL, SDR) },
|
2013-05-09 13:12:16 +00:00
|
|
|
};
|
|
|
|
|
2014-05-08 19:45:04 +00:00
|
|
|
// Try to replace speakers from the left of the list with the ones on the
|
|
|
|
// right, or the other way around.
|
|
|
|
static bool replace_speakers(struct mp_chmap *map, struct mp_chmap list[2])
|
2013-05-09 13:12:16 +00:00
|
|
|
{
|
2014-05-08 19:45:04 +00:00
|
|
|
assert(list[0].num == list[1].num);
|
2013-05-09 13:12:16 +00:00
|
|
|
if (!mp_chmap_is_valid(map))
|
|
|
|
return false;
|
|
|
|
for (int dir = 0; dir < 2; dir++) {
|
|
|
|
int from = dir ? 0 : 1;
|
|
|
|
int to = dir ? 1 : 0;
|
|
|
|
bool replaced = false;
|
|
|
|
struct mp_chmap t = *map;
|
|
|
|
for (int n = 0; n < t.num; n++) {
|
2014-05-08 19:45:04 +00:00
|
|
|
for (int i = 0; i < list[0].num; i++) {
|
|
|
|
if (t.speaker[n] == list[from].speaker[i]) {
|
|
|
|
t.speaker[n] = list[to].speaker[i];
|
2013-05-09 13:12:16 +00:00
|
|
|
replaced = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (replaced && mp_chmap_is_valid(&t)) {
|
|
|
|
*map = t;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Allow all channel layouts that can be expressed with mp_chmap.
|
|
|
|
// (By default, all layouts are rejected.)
|
|
|
|
void mp_chmap_sel_add_any(struct mp_chmap_sel *s)
|
|
|
|
{
|
|
|
|
s->allow_any = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Allow all waveext formats, and force waveext channel order.
|
|
|
|
void mp_chmap_sel_add_waveext(struct mp_chmap_sel *s)
|
|
|
|
{
|
|
|
|
s->allow_waveext = true;
|
|
|
|
}
|
|
|
|
|
2013-07-07 16:37:55 +00:00
|
|
|
// Classic ALSA-based MPlayer layouts.
|
2013-05-09 13:12:16 +00:00
|
|
|
void mp_chmap_sel_add_alsa_def(struct mp_chmap_sel *s)
|
|
|
|
{
|
|
|
|
for (int n = 0; n < MP_NUM_CHANNELS; n++) {
|
|
|
|
struct mp_chmap t;
|
|
|
|
mp_chmap_from_channels_alsa(&t, n);
|
|
|
|
if (t.num)
|
|
|
|
mp_chmap_sel_add_map(s, &t);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add a channel map that should be allowed.
|
|
|
|
void mp_chmap_sel_add_map(struct mp_chmap_sel *s, const struct mp_chmap *map)
|
|
|
|
{
|
2014-12-01 14:28:06 +00:00
|
|
|
if (!mp_chmap_is_valid(map))
|
|
|
|
return;
|
|
|
|
if (!s->chmaps)
|
|
|
|
s->chmaps = s->chmaps_storage;
|
2014-12-01 17:28:00 +00:00
|
|
|
if (s->num_chmaps == MP_ARRAY_SIZE(s->chmaps_storage)) {
|
2014-12-01 14:28:06 +00:00
|
|
|
if (!s->tmp)
|
|
|
|
return;
|
|
|
|
s->chmaps = talloc_memdup(s->tmp, s->chmaps, sizeof(s->chmaps_storage));
|
|
|
|
}
|
|
|
|
if (s->chmaps != s->chmaps_storage)
|
|
|
|
MP_TARRAY_GROW(s->tmp, s->chmaps, s->num_chmaps);
|
|
|
|
s->chmaps[s->num_chmaps++] = *map;
|
2013-05-09 13:12:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Allow all waveext formats in default order.
|
|
|
|
void mp_chmap_sel_add_waveext_def(struct mp_chmap_sel *s)
|
|
|
|
{
|
|
|
|
for (int n = 1; n < MP_NUM_CHANNELS; n++) {
|
|
|
|
struct mp_chmap map;
|
|
|
|
mp_chmap_from_channels(&map, n);
|
|
|
|
mp_chmap_sel_add_map(s, &map);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Whitelist a speaker (MP_SPEAKER_ID_...). All layouts that contain whitelisted
|
|
|
|
// speakers are allowed.
|
|
|
|
void mp_chmap_sel_add_speaker(struct mp_chmap_sel *s, int id)
|
|
|
|
{
|
|
|
|
assert(id >= 0 && id < MP_SPEAKER_ID_COUNT);
|
|
|
|
s->speakers[id] = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool test_speakers(const struct mp_chmap_sel *s, struct mp_chmap *map)
|
|
|
|
{
|
|
|
|
for (int n = 0; n < map->num; n++) {
|
|
|
|
if (!s->speakers[map->speaker[n]])
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool test_maps(const struct mp_chmap_sel *s, struct mp_chmap *map)
|
|
|
|
{
|
|
|
|
for (int n = 0; n < s->num_chmaps; n++) {
|
|
|
|
if (mp_chmap_equals_reordered(&s->chmaps[n], map)) {
|
|
|
|
*map = s->chmaps[n];
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool test_waveext(const struct mp_chmap_sel *s, struct mp_chmap *map)
|
|
|
|
{
|
|
|
|
if (s->allow_waveext) {
|
|
|
|
struct mp_chmap t = *map;
|
|
|
|
mp_chmap_reorder_to_waveext(&t);
|
|
|
|
if (mp_chmap_is_waveext(&t)) {
|
|
|
|
*map = t;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool test_layout(const struct mp_chmap_sel *s, struct mp_chmap *map)
|
|
|
|
{
|
|
|
|
if (!mp_chmap_is_valid(map))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return s->allow_any || test_waveext(s, map) || test_speakers(s, map) ||
|
|
|
|
test_maps(s, map);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Determine which channel map to use given a source channel map, and various
|
|
|
|
// parameters restricting possible choices. If the map doesn't match, select
|
|
|
|
// a fallback and set it.
|
|
|
|
// If no matching layout is found, a reordered layout may be returned.
|
|
|
|
// If that is not possible, a fallback for up/downmixing may be returned.
|
|
|
|
// If no choice is possible, set *map to empty.
|
|
|
|
bool mp_chmap_sel_adjust(const struct mp_chmap_sel *s, struct mp_chmap *map)
|
|
|
|
{
|
|
|
|
if (test_layout(s, map))
|
|
|
|
return true;
|
|
|
|
if (mp_chmap_is_unknown(map)) {
|
|
|
|
struct mp_chmap t = {0};
|
|
|
|
if (mp_chmap_sel_get_def(s, &t, map->num) && test_layout(s, &t)) {
|
|
|
|
*map = t;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
2014-05-08 19:45:04 +00:00
|
|
|
for (int i = 0; i < MP_ARRAY_SIZE(speaker_replacements); i++) {
|
|
|
|
struct mp_chmap t = *map;
|
2014-06-10 21:56:05 +00:00
|
|
|
struct mp_chmap *r = (struct mp_chmap *)speaker_replacements[i];
|
2014-05-08 19:45:04 +00:00
|
|
|
if (replace_speakers(&t, r) && test_layout(s, &t)) {
|
|
|
|
*map = t;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
2014-12-28 08:38:22 +00:00
|
|
|
|
|
|
|
if (mp_chmap_sel_fallback(s, map))
|
|
|
|
return true;
|
|
|
|
|
2013-05-09 13:12:16 +00:00
|
|
|
// Fallback to mono/stereo as last resort
|
2014-12-20 15:21:52 +00:00
|
|
|
*map = (struct mp_chmap) MP_CHMAP_INIT_STEREO;
|
2014-12-20 15:48:30 +00:00
|
|
|
if (test_layout(s, map))
|
|
|
|
return true;
|
|
|
|
*map = (struct mp_chmap) MP_CHMAP_INIT_MONO;
|
|
|
|
if (test_layout(s, map))
|
2013-05-09 13:12:16 +00:00
|
|
|
return true;
|
|
|
|
*map = (struct mp_chmap) {0};
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2014-12-28 08:38:22 +00:00
|
|
|
#define UPMIX_IDX 0
|
|
|
|
#define DOWNMIX_IDX 1
|
|
|
|
#define FALLBACK_IDX 2
|
|
|
|
|
|
|
|
static bool test_fallbacks(struct mp_chmap *a, struct mp_chmap *b,
|
|
|
|
int best_diffs[2], struct mp_chmap best[2])
|
|
|
|
{
|
|
|
|
struct mp_chmap diff1, diff2;
|
|
|
|
|
|
|
|
mp_chmap_diff(a, b, &diff1);
|
|
|
|
if (mp_chmap_contains(a, b) && best_diffs[UPMIX_IDX] > diff1.num) {
|
|
|
|
best[UPMIX_IDX] = *a;
|
|
|
|
best_diffs[UPMIX_IDX] = diff1.num;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
mp_chmap_diff(b, a, &diff2);
|
|
|
|
if (mp_chmap_contains(b, a) && best_diffs[DOWNMIX_IDX] > diff2.num) {
|
|
|
|
best[DOWNMIX_IDX] = *a;
|
|
|
|
best_diffs[DOWNMIX_IDX] = diff2.num;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (diff1.num > 0 && best_diffs[FALLBACK_IDX] > diff1.num) {
|
|
|
|
best[FALLBACK_IDX] = *a;
|
|
|
|
best_diffs[FALLBACK_IDX] = diff1.num;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (diff2.num > 0 && best_diffs[FALLBACK_IDX] > diff2.num) {
|
|
|
|
best[FALLBACK_IDX] = *a;
|
|
|
|
best_diffs[FALLBACK_IDX] = diff2.num;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Determine which channel map to fallback to given a source channel map. It
|
|
|
|
// uses the following heuristic:
|
|
|
|
// 1) If mono is required always prefer stereo to a multichannel upmix.
|
|
|
|
// 2) Search for an upmix that is an exact superset of the required chmap.
|
|
|
|
// 3) Search for a downmix that is the exact subset of the required chmap.
|
|
|
|
// 4) Search for either an upmix or downmix that is the closest (minimum
|
|
|
|
// difference of speakers) to the required chmap.
|
|
|
|
bool mp_chmap_sel_fallback(const struct mp_chmap_sel *s, struct mp_chmap *map)
|
|
|
|
{
|
|
|
|
// special case: if possible always fallback mono to stereo (instead of
|
|
|
|
// looking for a multichannel upmix)
|
|
|
|
struct mp_chmap mono = MP_CHMAP_INIT_MONO;
|
|
|
|
struct mp_chmap stereo = MP_CHMAP_INIT_STEREO;
|
|
|
|
if (mp_chmap_equals(&mono, map) && test_layout(s, &stereo)) {
|
|
|
|
*map = stereo;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
int best_diffs[] = { INT_MAX, INT_MAX, INT_MAX };
|
|
|
|
struct mp_chmap best[] = { {0}, {0}, {0} };
|
|
|
|
|
|
|
|
for (int n = 0; n < s->num_chmaps; n++) {
|
|
|
|
struct mp_chmap e = s->chmaps[n];
|
|
|
|
|
|
|
|
if (mp_chmap_is_unknown(&e))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (test_fallbacks(&e, map, best_diffs, best))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// in case we didn't match any fallback retry after replacing speakers
|
|
|
|
for (int i = 0; i < MP_ARRAY_SIZE(speaker_replacements); i++) {
|
|
|
|
struct mp_chmap t = e;
|
|
|
|
struct mp_chmap *r = (struct mp_chmap *)speaker_replacements[i];
|
|
|
|
if (replace_speakers(&t, r)) {
|
|
|
|
if (test_fallbacks(&t, map, best_diffs, best))
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (int i = UPMIX_IDX; i < MP_ARRAY_SIZE(best); i++) {
|
|
|
|
if (best_diffs[i] < INT_MAX) {
|
|
|
|
*map = best[i];
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2013-05-09 13:12:16 +00:00
|
|
|
// Set map to a default layout with num channels. Used for audio APIs that
|
|
|
|
// return a channel count as part of format negotiation, but give no
|
|
|
|
// information about the channel layout.
|
|
|
|
// If the channel count is correct, do nothing and leave *map untouched.
|
|
|
|
bool mp_chmap_sel_get_def(const struct mp_chmap_sel *s, struct mp_chmap *map,
|
|
|
|
int num)
|
|
|
|
{
|
|
|
|
if (map->num != num) {
|
|
|
|
*map = (struct mp_chmap) {0};
|
|
|
|
// Set of speakers or waveext might allow it.
|
|
|
|
struct mp_chmap t;
|
|
|
|
mp_chmap_from_channels(&t, num);
|
|
|
|
mp_chmap_reorder_to_waveext(&t);
|
|
|
|
if (test_layout(s, &t)) {
|
|
|
|
*map = t;
|
|
|
|
} else {
|
|
|
|
for (int n = 0; n < s->num_chmaps; n++) {
|
|
|
|
if (s->chmaps[n].num == num) {
|
|
|
|
*map = s->chmaps[n];
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return map->num > 0;
|
|
|
|
}
|