mpd/src/tag/Tag.cxx

225 lines
4.4 KiB
C++
Raw Normal View History

/*
2013-01-07 10:36:27 +01:00
* Copyright (C) 2003-2013 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 "config.h"
2013-07-30 20:11:57 +02:00
#include "Tag.hxx"
2013-01-07 10:36:27 +01:00
#include "TagPool.hxx"
#include "TagString.hxx"
#include "TagSettings.h"
#include <glib.h>
#include <assert.h>
2013-07-30 20:11:57 +02:00
#include <string.h>
TagType
tag_name_parse(const char *name)
{
2013-01-07 10:36:27 +01:00
assert(name != nullptr);
for (unsigned i = 0; i < TAG_NUM_OF_ITEM_TYPES; ++i) {
2013-01-07 10:36:27 +01:00
assert(tag_item_names[i] != nullptr);
if (strcmp(name, tag_item_names[i]) == 0)
return (TagType)i;
}
return TAG_NUM_OF_ITEM_TYPES;
}
TagType
tag_name_parse_i(const char *name)
{
2013-01-07 10:36:27 +01:00
assert(name != nullptr);
for (unsigned i = 0; i < TAG_NUM_OF_ITEM_TYPES; ++i) {
2013-01-07 10:36:27 +01:00
assert(tag_item_names[i] != nullptr);
if (g_ascii_strcasecmp(name, tag_item_names[i]) == 0)
return (TagType)i;
}
return TAG_NUM_OF_ITEM_TYPES;
}
2013-07-30 20:11:57 +02:00
static size_t
items_size(const Tag &tag)
{
2013-07-30 20:11:57 +02:00
return tag.num_items * sizeof(TagItem *);
}
void
Tag::Clear()
{
time = -1;
has_playlist = false;
tag_pool_lock.lock();
for (unsigned i = 0; i < num_items; ++i)
tag_pool_put_item(items[i]);
tag_pool_lock.unlock();
g_free(items);
items = nullptr;
num_items = 0;
}
2013-07-30 20:11:57 +02:00
Tag::~Tag()
{
tag_pool_lock.lock();
2013-07-30 20:11:57 +02:00
for (int i = num_items; --i >= 0; )
tag_pool_put_item(items[i]);
tag_pool_lock.unlock();
g_free(items);
}
2013-07-30 20:11:57 +02:00
Tag::Tag(const Tag &other)
:time(other.time), has_playlist(other.has_playlist),
items(nullptr),
num_items(other.num_items)
{
2013-07-30 20:11:57 +02:00
if (num_items > 0) {
items = (TagItem **)g_malloc(items_size(other));
2013-07-30 20:11:57 +02:00
tag_pool_lock.lock();
for (unsigned i = 0; i < num_items; i++)
items[i] = tag_pool_dup_item(other.items[i]);
tag_pool_lock.unlock();
}
}
2013-07-30 20:11:57 +02:00
Tag *
Tag::Merge(const Tag &base, const Tag &add)
{
unsigned n;
/* allocate new tag object */
2013-07-30 20:11:57 +02:00
Tag *ret = new Tag();
ret->time = add.time > 0 ? add.time : base.time;
ret->num_items = base.num_items + add.num_items;
2013-01-07 10:36:27 +01:00
ret->items = ret->num_items > 0
2013-07-30 20:11:57 +02:00
? (TagItem **)g_malloc(items_size(*ret))
2013-01-07 10:36:27 +01:00
: nullptr;
tag_pool_lock.lock();
/* copy all items from "add" */
2013-07-30 20:11:57 +02:00
for (unsigned i = 0; i < add.num_items; ++i)
ret->items[i] = tag_pool_dup_item(add.items[i]);
2013-07-30 20:11:57 +02:00
n = add.num_items;
/* copy additional items from "base" */
2013-07-30 20:11:57 +02:00
for (unsigned i = 0; i < base.num_items; ++i)
if (!add.HasType(base.items[i]->type))
ret->items[n++] = tag_pool_dup_item(base.items[i]);
tag_pool_lock.unlock();
assert(n <= ret->num_items);
if (n < ret->num_items) {
/* some tags were not copied - shrink ret->items */
assert(n > 0);
ret->num_items = n;
2013-07-30 20:11:57 +02:00
ret->items = (TagItem **)
g_realloc(ret->items, items_size(*ret));
}
return ret;
}
2013-07-30 20:11:57 +02:00
Tag *
Tag::MergeReplace(Tag *base, Tag *add)
{
2013-01-07 10:36:27 +01:00
if (add == nullptr)
return base;
2013-01-07 10:36:27 +01:00
if (base == nullptr)
return add;
2013-07-30 20:11:57 +02:00
Tag *tag = Merge(*base, *add);
delete base;
delete add;
return tag;
}
2009-01-15 00:21:08 +01:00
const char *
Tag::GetValue(TagType type) const
{
assert(type < TAG_NUM_OF_ITEM_TYPES);
2013-07-30 20:11:57 +02:00
for (unsigned i = 0; i < num_items; i++)
if (items[i]->type == type)
return items[i]->value;
2009-01-15 00:21:08 +01:00
2013-01-07 10:36:27 +01:00
return nullptr;
2009-01-15 00:21:08 +01:00
}
2013-07-30 20:11:57 +02:00
bool
Tag::HasType(TagType type) const
2009-01-15 00:21:08 +01:00
{
2013-07-30 20:11:57 +02:00
return GetValue(type) != nullptr;
}
2013-07-30 20:11:57 +02:00
void
Tag::AddItemInternal(TagType type, const char *value, size_t len)
{
2013-07-30 20:11:57 +02:00
unsigned int i = num_items;
char *p = FixTagString(value, len);
2013-01-07 10:36:27 +01:00
if (p != nullptr) {
value = p;
len = strlen(value);
}
2013-07-30 20:11:57 +02:00
num_items++;
items = (TagItem **)g_realloc(items, items_size(*this));
tag_pool_lock.lock();
2013-07-30 20:11:57 +02:00
items[i] = tag_pool_get_item(type, value, len);
tag_pool_lock.unlock();
g_free(p);
}
2013-07-30 20:11:57 +02:00
void
Tag::AddItem(TagType type, const char *value, size_t len)
{
if (ignore_tag_items[type])
return;
2013-07-30 20:11:57 +02:00
if (value == nullptr || len == 0)
return;
2013-07-30 20:11:57 +02:00
AddItemInternal(type, value, len);
}
void
Tag::AddItem(TagType type, const char *value)
2013-07-30 20:11:57 +02:00
{
AddItem(type, value, strlen(value));
}