ce49d99c2f
Since we switched from autotools to Meson in commit
94592c1406
, we don't need to include
`config.h` early to properly enable large file support. Meson passes
the required macros on the compiler command line instead of defining
them in `config.h`.
This means we can include `config.h` at any time, whenever we want to
check its macros, and there are no ordering constraints.
159 lines
3.3 KiB
C++
159 lines
3.3 KiB
C++
/*
|
|
* Copyright 2003-2018 The Music Player Daemon Project
|
|
* http://www.musicpd.org
|
|
*
|
|
* This program 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.
|
|
*
|
|
* This program 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 this program; if not, write to the Free Software Foundation, Inc.,
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*/
|
|
|
|
#include "Tag.hxx"
|
|
#include "Pool.hxx"
|
|
#include "Builder.hxx"
|
|
|
|
#include <assert.h>
|
|
|
|
void
|
|
Tag::Clear() noexcept
|
|
{
|
|
duration = SignedSongTime::Negative();
|
|
has_playlist = false;
|
|
|
|
{
|
|
const std::lock_guard<Mutex> protect(tag_pool_lock);
|
|
for (unsigned i = 0; i < num_items; ++i)
|
|
tag_pool_put_item(items[i]);
|
|
}
|
|
|
|
delete[] items;
|
|
items = nullptr;
|
|
num_items = 0;
|
|
}
|
|
|
|
Tag::Tag(const Tag &other) noexcept
|
|
:duration(other.duration), has_playlist(other.has_playlist),
|
|
num_items(other.num_items),
|
|
items(nullptr)
|
|
{
|
|
if (num_items > 0) {
|
|
items = new TagItem *[num_items];
|
|
|
|
const std::lock_guard<Mutex> protect(tag_pool_lock);
|
|
for (unsigned i = 0; i < num_items; i++)
|
|
items[i] = tag_pool_dup_item(other.items[i]);
|
|
}
|
|
}
|
|
|
|
std::unique_ptr<Tag>
|
|
Tag::Merge(const Tag &base, const Tag &add) noexcept
|
|
{
|
|
TagBuilder builder(add);
|
|
builder.Complement(base);
|
|
return builder.CommitNew();
|
|
}
|
|
|
|
std::unique_ptr<Tag>
|
|
Tag::Merge(std::unique_ptr<Tag> base, std::unique_ptr<Tag> add) noexcept
|
|
{
|
|
if (add == nullptr)
|
|
return base;
|
|
|
|
if (base == nullptr)
|
|
return add;
|
|
|
|
return Merge(*base, *add);
|
|
}
|
|
|
|
const char *
|
|
Tag::GetValue(TagType type) const noexcept
|
|
{
|
|
assert(type < TAG_NUM_OF_ITEM_TYPES);
|
|
|
|
for (const auto &item : *this)
|
|
if (item.type == type)
|
|
return item.value;
|
|
|
|
return nullptr;
|
|
}
|
|
|
|
bool
|
|
Tag::HasType(TagType type) const noexcept
|
|
{
|
|
return GetValue(type) != nullptr;
|
|
}
|
|
|
|
static TagType
|
|
DecaySort(TagType type) noexcept
|
|
{
|
|
switch (type) {
|
|
case TAG_ARTIST_SORT:
|
|
return TAG_ARTIST;
|
|
|
|
case TAG_ALBUM_SORT:
|
|
return TAG_ALBUM;
|
|
|
|
case TAG_ALBUM_ARTIST_SORT:
|
|
return TAG_ALBUM_ARTIST;
|
|
|
|
default:
|
|
return TAG_NUM_OF_ITEM_TYPES;
|
|
}
|
|
}
|
|
|
|
static TagType
|
|
Fallback(TagType type) noexcept
|
|
{
|
|
switch (type) {
|
|
case TAG_ALBUM_ARTIST:
|
|
return TAG_ARTIST;
|
|
|
|
case TAG_MUSICBRAINZ_ALBUMARTISTID:
|
|
return TAG_MUSICBRAINZ_ARTISTID;
|
|
|
|
default:
|
|
return TAG_NUM_OF_ITEM_TYPES;
|
|
}
|
|
}
|
|
|
|
const char *
|
|
Tag::GetSortValue(TagType type) const noexcept
|
|
{
|
|
const char *value = GetValue(type);
|
|
if (value != nullptr)
|
|
return value;
|
|
|
|
/* try without *_SORT */
|
|
const auto no_sort_type = DecaySort(type);
|
|
if (no_sort_type != TAG_NUM_OF_ITEM_TYPES) {
|
|
value = GetValue(no_sort_type);
|
|
if (value != nullptr)
|
|
return value;
|
|
}
|
|
|
|
/* fall back from TAG_ALBUM_ARTIST to TAG_ALBUM */
|
|
|
|
type = Fallback(type);
|
|
if (type != TAG_NUM_OF_ITEM_TYPES)
|
|
return GetSortValue(type);
|
|
|
|
if (no_sort_type != TAG_NUM_OF_ITEM_TYPES) {
|
|
type = Fallback(no_sort_type);
|
|
if (type != TAG_NUM_OF_ITEM_TYPES)
|
|
return GetSortValue(type);
|
|
}
|
|
|
|
/* finally fall back to empty string */
|
|
|
|
return "";
|
|
}
|