/* 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 "database.h" #include "client.h" #include "playlist.h" #include "song.h" #include "song_print.h" #include "tag.h" #include "strset.h" #include "log.h" #include "stored_playlist.h" #include <glib.h> #include <stdlib.h> typedef struct _ListCommandItem { int8_t 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(struct directory *directory, void *data) { int *count = (int *)data; *count += directory->songs.nr; return 0; } static int printDirectoryInDirectory(struct directory *directory, void *data) { struct client *client = data; if (!directory_is_root(directory)) client_printf(client, "directory: %s\n", directory_get_path(directory)); return 0; } static int printSongInDirectory(struct song *song, G_GNUC_UNUSED void *data) { struct client *client = data; song_print_url(client, song); return 0; } struct search_data { struct client *client; LocateTagItemArray array; }; static int searchInDirectory(struct song *song, void *_data) { struct search_data *data = _data; LocateTagItemArray *array = &data->array; if (strstrSearchTags(song, array->numItems, array->items)) return song_print_info(data->client, song); return 0; } int searchForSongsIn(struct client *client, const char *name, int numItems, LocateTagItem * items) { int ret; int i; char **originalNeedles = g_new(char *, numItems); struct search_data data; for (i = 0; i < numItems; i++) { originalNeedles[i] = items[i].needle; items[i].needle = g_utf8_casefold(originalNeedles[i], -1); } data.client = client; data.array.numItems = numItems; data.array.items = items; ret = db_walk(name, searchInDirectory, NULL, &data); for (i = 0; i < numItems; i++) { g_free(items[i].needle); items[i].needle = originalNeedles[i]; } free(originalNeedles); return ret; } static int findInDirectory(struct song *song, void *_data) { struct search_data *data = _data; LocateTagItemArray *array = &data->array; if (tagItemsFoundAndMatches(song, array->numItems, array->items)) return song_print_info(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 db_walk(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(struct 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 = db_walk(name, searchStatsInDirectory, NULL, &stats); if (ret == 0) printSearchStats(client, &stats); return ret; } int printAllIn(struct client *client, const char *name) { return db_walk(name, printSongInDirectory, printDirectoryInDirectory, client); } static int directoryAddSongToPlaylist(struct song *song, G_GNUC_UNUSED void *data) { return addSongToPlaylist(song, NULL); } struct add_data { const char *path; }; static int directoryAddSongToStoredPlaylist(struct song *song, void *_data) { struct add_data *data = _data; if (spl_append_song(data->path, song) != 0) return -1; return 0; } int addAllIn(const char *name) { return db_walk(name, directoryAddSongToPlaylist, NULL, NULL); } int addAllInToStoredPlaylist(const char *name, const char *utf8file) { struct add_data data = { .path = utf8file, }; return db_walk(name, directoryAddSongToStoredPlaylist, NULL, &data); } static int directoryPrintSongInfo(struct song *song, void *data) { struct client *client = data; song_print_info(client, song); return 0; } static int sumSongTime(struct 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 db_walk(name, directoryPrintSongInfo, printDirectoryInDirectory, client); } int countSongsIn(const char *name) { int count = 0; void *ptr = (void *)&count; db_walk(name, NULL, countSongsInDirectory, ptr); return count; } unsigned long sumSongTimesIn(const char *name) { unsigned long dbPlayTime = 0; void *ptr = (void *)&dbPlayTime; db_walk(name, sumSongTime, NULL, ptr); return dbPlayTime; } static ListCommandItem *newListCommandItem(int tagType, int numConditionals, LocateTagItem * conditionals) { ListCommandItem *item = g_new(ListCommandItem, 1); 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, struct song *song, enum tag_type tagType) { int i; struct tag *tag = song->tag; if (tagType == LOCATE_TAG_FILE_TYPE) { song_print_url(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); return; } } strset_add(set, ""); } struct list_tags_data { struct client *client; ListCommandItem *item; struct strset *set; }; static int listUniqueTagsInDirectory(struct 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 = db_walk(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(struct directory *dir, void *data) { int *sum = data; if (directory_is_root(dir)) return 0; *sum += (strlen(directory_get_path(dir)) + 1 - sizeof(struct directory *)) * dir->songs.nr; return 0; } static int sumSavedFilenameMemoryInSong(struct song *song, void *data) { int *sum = data; *sum += strlen(song->url) + 1; return 0; } void printSavedMemoryFromFilenames(void) { int sum = 0; db_walk(NULL, sumSavedFilenameMemoryInSong, sumSavedFilenameMemoryInDirectory, (void *)&sum); DEBUG("saved memory from filenames: %i\n", sum); }