f0e64ceb48
With a large music database, the linear string collection in tagTracker.c becomes very slow. We implemented that in a quick'n'dirty fashion when we removed tree.c, and now we rewrite it using the fast hashed string set.
388 lines
8.4 KiB
C
388 lines
8.4 KiB
C
/* the Music Player Daemon (MPD)
|
|
* Copyright (C) 2003-2007 by Warren Dukes (warren.dukes@gmail.com)
|
|
* This project's homepage is: 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*/
|
|
|
|
#include "dbUtils.h"
|
|
|
|
#include "directory.h"
|
|
#include "client.h"
|
|
#include "utils.h"
|
|
#include "playlist.h"
|
|
#include "song.h"
|
|
#include "song_print.h"
|
|
#include "tag.h"
|
|
#include "strset.h"
|
|
#include "log.h"
|
|
#include "storedPlaylist.h"
|
|
|
|
typedef struct _ListCommandItem {
|
|
mpd_sint8 tagType;
|
|
int numConditionals;
|
|
LocateTagItem *conditionals;
|
|
} ListCommandItem;
|
|
|
|
typedef struct _LocateTagItemArray {
|
|
int numItems;
|
|
LocateTagItem *items;
|
|
} LocateTagItemArray;
|
|
|
|
typedef struct _SearchStats {
|
|
LocateTagItemArray locateArray;
|
|
int numberOfSongs;
|
|
unsigned long playTime;
|
|
} SearchStats;
|
|
|
|
static int countSongsInDirectory(Directory * directory,
|
|
void *data)
|
|
{
|
|
int *count = (int *)data;
|
|
|
|
*count += directory->songs->numberOfNodes;
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int printDirectoryInDirectory(Directory * directory, void *data)
|
|
{
|
|
struct client *client = data;
|
|
if (directory->path) {
|
|
client_printf(client, "directory: %s\n", getDirectoryPath(directory));
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static int printSongInDirectory(Song * song, mpd_unused void *data)
|
|
{
|
|
struct client *client = data;
|
|
printSongUrl(client, song);
|
|
return 0;
|
|
}
|
|
|
|
struct search_data {
|
|
struct client *client;
|
|
LocateTagItemArray array;
|
|
};
|
|
|
|
static int searchInDirectory(Song * song, void *_data)
|
|
{
|
|
struct search_data *data = _data;
|
|
LocateTagItemArray *array = &data->array;
|
|
|
|
if (strstrSearchTags(song, array->numItems, array->items))
|
|
printSongInfo(data->client, song);
|
|
|
|
return 0;
|
|
}
|
|
|
|
int searchForSongsIn(struct client *client, const char *name,
|
|
int numItems, LocateTagItem * items)
|
|
{
|
|
int ret;
|
|
int i;
|
|
|
|
char **originalNeedles = xmalloc(numItems * sizeof(char *));
|
|
struct search_data data;
|
|
|
|
for (i = 0; i < numItems; i++) {
|
|
originalNeedles[i] = items[i].needle;
|
|
items[i].needle = strDupToUpper(originalNeedles[i]);
|
|
}
|
|
|
|
data.client = client;
|
|
data.array.numItems = numItems;
|
|
data.array.items = items;
|
|
|
|
ret = traverseAllIn(name, searchInDirectory, NULL, &data);
|
|
|
|
for (i = 0; i < numItems; i++) {
|
|
free(items[i].needle);
|
|
items[i].needle = originalNeedles[i];
|
|
}
|
|
|
|
free(originalNeedles);
|
|
|
|
return ret;
|
|
}
|
|
|
|
static int findInDirectory(Song * song, void *_data)
|
|
{
|
|
struct search_data *data = _data;
|
|
LocateTagItemArray *array = &data->array;
|
|
|
|
if (tagItemsFoundAndMatches(song, array->numItems, array->items))
|
|
printSongInfo(data->client, song);
|
|
|
|
return 0;
|
|
}
|
|
|
|
int findSongsIn(struct client *client, const char *name,
|
|
int numItems, LocateTagItem * items)
|
|
{
|
|
struct search_data data;
|
|
|
|
data.client = client;
|
|
data.array.numItems = numItems;
|
|
data.array.items = items;
|
|
|
|
return traverseAllIn(name, findInDirectory, NULL, &data);
|
|
}
|
|
|
|
static void printSearchStats(struct client *client, SearchStats *stats)
|
|
{
|
|
client_printf(client, "songs: %i\n", stats->numberOfSongs);
|
|
client_printf(client, "playtime: %li\n", stats->playTime);
|
|
}
|
|
|
|
static int searchStatsInDirectory(Song * song, void *data)
|
|
{
|
|
SearchStats *stats = data;
|
|
|
|
if (tagItemsFoundAndMatches(song, stats->locateArray.numItems,
|
|
stats->locateArray.items)) {
|
|
stats->numberOfSongs++;
|
|
if (song->tag->time > 0)
|
|
stats->playTime += song->tag->time;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int searchStatsForSongsIn(struct client *client, const char *name,
|
|
int numItems, LocateTagItem * items)
|
|
{
|
|
SearchStats stats;
|
|
int ret;
|
|
|
|
stats.locateArray.numItems = numItems;
|
|
stats.locateArray.items = items;
|
|
stats.numberOfSongs = 0;
|
|
stats.playTime = 0;
|
|
|
|
ret = traverseAllIn(name, searchStatsInDirectory, NULL, &stats);
|
|
if (ret == 0)
|
|
printSearchStats(client, &stats);
|
|
|
|
return ret;
|
|
}
|
|
|
|
int printAllIn(struct client *client, const char *name)
|
|
{
|
|
return traverseAllIn(name, printSongInDirectory,
|
|
printDirectoryInDirectory, client);
|
|
}
|
|
|
|
static int directoryAddSongToPlaylist(Song * song, mpd_unused void *data)
|
|
{
|
|
return addSongToPlaylist(song, NULL);
|
|
}
|
|
|
|
struct add_data {
|
|
const char *path;
|
|
};
|
|
|
|
static int directoryAddSongToStoredPlaylist(Song *song, void *_data)
|
|
{
|
|
struct add_data *data = _data;
|
|
|
|
if (appendSongToStoredPlaylistByPath(data->path, song) != 0)
|
|
return -1;
|
|
return 0;
|
|
}
|
|
|
|
int addAllIn(const char *name)
|
|
{
|
|
return traverseAllIn(name, directoryAddSongToPlaylist, NULL, NULL);
|
|
}
|
|
|
|
int addAllInToStoredPlaylist(const char *name, const char *utf8file)
|
|
{
|
|
struct add_data data = {
|
|
.path = utf8file,
|
|
};
|
|
|
|
return traverseAllIn(name, directoryAddSongToStoredPlaylist, NULL,
|
|
&data);
|
|
}
|
|
|
|
static int directoryPrintSongInfo(Song * song, void *data)
|
|
{
|
|
struct client *client = data;
|
|
|
|
return printSongInfo(client, song);
|
|
}
|
|
|
|
static int sumSongTime(Song * song, void *data)
|
|
{
|
|
unsigned long *sum_time = (unsigned long *)data;
|
|
|
|
if (song->tag && song->tag->time >= 0)
|
|
*sum_time += song->tag->time;
|
|
|
|
return 0;
|
|
}
|
|
|
|
int printInfoForAllIn(struct client *client, const char *name)
|
|
{
|
|
return traverseAllIn(name, directoryPrintSongInfo,
|
|
printDirectoryInDirectory, client);
|
|
}
|
|
|
|
int countSongsIn(const char *name)
|
|
{
|
|
int count = 0;
|
|
void *ptr = (void *)&count;
|
|
|
|
traverseAllIn(name, NULL, countSongsInDirectory, ptr);
|
|
|
|
return count;
|
|
}
|
|
|
|
unsigned long sumSongTimesIn(const char *name)
|
|
{
|
|
unsigned long dbPlayTime = 0;
|
|
void *ptr = (void *)&dbPlayTime;
|
|
|
|
traverseAllIn(name, sumSongTime, NULL, ptr);
|
|
|
|
return dbPlayTime;
|
|
}
|
|
|
|
static ListCommandItem *newListCommandItem(int tagType, int numConditionals,
|
|
LocateTagItem * conditionals)
|
|
{
|
|
ListCommandItem *item = xmalloc(sizeof(ListCommandItem));
|
|
|
|
item->tagType = tagType;
|
|
item->numConditionals = numConditionals;
|
|
item->conditionals = conditionals;
|
|
|
|
return item;
|
|
}
|
|
|
|
static void freeListCommandItem(ListCommandItem * item)
|
|
{
|
|
free(item);
|
|
}
|
|
|
|
static void visitTag(struct client *client, struct strset *set,
|
|
Song * song, enum tag_type tagType)
|
|
{
|
|
int i;
|
|
struct tag *tag = song->tag;
|
|
|
|
if (tagType == LOCATE_TAG_FILE_TYPE) {
|
|
printSongUrl(client, song);
|
|
return;
|
|
}
|
|
|
|
if (!tag)
|
|
return;
|
|
|
|
for (i = 0; i < tag->numOfItems; i++) {
|
|
if (tag->items[i]->type == tagType) {
|
|
strset_add(set, tag->items[i]->value);
|
|
}
|
|
}
|
|
}
|
|
|
|
struct list_tags_data {
|
|
struct client *client;
|
|
ListCommandItem *item;
|
|
struct strset *set;
|
|
};
|
|
|
|
static int listUniqueTagsInDirectory(Song * song, void *_data)
|
|
{
|
|
struct list_tags_data *data = _data;
|
|
ListCommandItem *item = data->item;
|
|
|
|
if (tagItemsFoundAndMatches(song, item->numConditionals,
|
|
item->conditionals)) {
|
|
visitTag(data->client, data->set, song, item->tagType);
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int listAllUniqueTags(struct client *client, int type, int numConditionals,
|
|
LocateTagItem * conditionals)
|
|
{
|
|
int ret;
|
|
ListCommandItem *item = newListCommandItem(type, numConditionals,
|
|
conditionals);
|
|
struct list_tags_data data = {
|
|
.client = client,
|
|
.item = item,
|
|
};
|
|
|
|
if (type >= 0 && type <= TAG_NUM_OF_ITEM_TYPES) {
|
|
data.set = strset_new();
|
|
}
|
|
|
|
ret = traverseAllIn(NULL, listUniqueTagsInDirectory, NULL,
|
|
&data);
|
|
|
|
if (type >= 0 && type <= TAG_NUM_OF_ITEM_TYPES) {
|
|
const char *value;
|
|
|
|
strset_rewind(data.set);
|
|
|
|
while ((value = strset_next(data.set)) != NULL)
|
|
client_printf(client, "%s: %s\n",
|
|
mpdTagItemKeys[type],
|
|
value);
|
|
|
|
strset_free(data.set);
|
|
}
|
|
|
|
freeListCommandItem(item);
|
|
|
|
return ret;
|
|
}
|
|
|
|
static int sumSavedFilenameMemoryInDirectory(Directory * dir, void *data)
|
|
{
|
|
int *sum = data;
|
|
|
|
if (!dir->path)
|
|
return 0;
|
|
|
|
*sum += (strlen(getDirectoryPath(dir)) + 1 - sizeof(Directory *)) *
|
|
dir->songs->numberOfNodes;
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int sumSavedFilenameMemoryInSong(Song * song, void *data)
|
|
{
|
|
int *sum = data;
|
|
|
|
*sum += strlen(song->url) + 1;
|
|
|
|
return 0;
|
|
}
|
|
|
|
void printSavedMemoryFromFilenames(void)
|
|
{
|
|
int sum = 0;
|
|
|
|
traverseAllIn(NULL, sumSavedFilenameMemoryInSong,
|
|
sumSavedFilenameMemoryInDirectory, (void *)&sum);
|
|
|
|
DEBUG("saved memory from filenames: %i\n", sum);
|
|
}
|