2009-03-13 18:43:16 +01:00
|
|
|
/*
|
2011-01-29 10:13:54 +01:00
|
|
|
* Copyright (C) 2003-2011 The Music Player Daemon Project
|
2009-03-13 18:43:16 +01:00
|
|
|
* http://www.musicpd.org
|
2004-02-24 00:41:20 +01:00
|
|
|
*
|
|
|
|
* 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.
|
2009-03-13 18:43:16 +01:00
|
|
|
*
|
|
|
|
* 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.
|
2004-02-24 00:41:20 +01:00
|
|
|
*/
|
|
|
|
|
2009-11-12 09:12:38 +01:00
|
|
|
#include "config.h"
|
2004-02-24 00:41:20 +01:00
|
|
|
#include "directory.h"
|
2012-07-30 07:26:08 +02:00
|
|
|
|
|
|
|
extern "C" {
|
2008-10-31 09:20:02 +01:00
|
|
|
#include "song.h"
|
2012-01-24 21:33:09 +01:00
|
|
|
#include "song_sort.h"
|
2012-02-12 17:50:30 +01:00
|
|
|
#include "playlist_vector.h"
|
2008-10-13 16:32:39 +02:00
|
|
|
#include "path.h"
|
2012-01-24 18:20:58 +01:00
|
|
|
#include "util/list_sort.h"
|
2011-09-10 19:24:30 +02:00
|
|
|
#include "db_visitor.h"
|
2012-01-24 18:20:58 +01:00
|
|
|
#include "db_lock.h"
|
2012-07-30 07:26:08 +02:00
|
|
|
}
|
2005-03-06 20:00:58 +01:00
|
|
|
|
2009-01-02 16:26:19 +01:00
|
|
|
#include <glib.h>
|
|
|
|
|
2008-10-09 15:23:37 +02:00
|
|
|
#include <assert.h>
|
|
|
|
#include <string.h>
|
2009-01-02 16:26:19 +01:00
|
|
|
#include <stdlib.h>
|
2008-10-09 15:23:37 +02:00
|
|
|
|
2008-10-08 10:49:05 +02:00
|
|
|
struct directory *
|
2008-10-13 09:55:00 +02:00
|
|
|
directory_new(const char *path, struct directory *parent)
|
2006-07-20 18:02:40 +02:00
|
|
|
{
|
2008-10-13 09:55:00 +02:00
|
|
|
size_t pathlen = strlen(path);
|
2004-02-24 00:41:20 +01:00
|
|
|
|
2008-10-13 09:55:00 +02:00
|
|
|
assert(path != NULL);
|
|
|
|
assert((*path == 0) == (parent == NULL));
|
2004-02-24 00:41:20 +01:00
|
|
|
|
2012-07-30 07:26:08 +02:00
|
|
|
struct directory *directory =
|
|
|
|
(struct directory *)g_malloc0(sizeof(*directory)
|
|
|
|
- sizeof(directory->path)
|
|
|
|
+ pathlen + 1);
|
2012-01-24 18:20:58 +01:00
|
|
|
INIT_LIST_HEAD(&directory->children);
|
2012-01-24 21:33:09 +01:00
|
|
|
INIT_LIST_HEAD(&directory->songs);
|
2012-02-12 17:50:30 +01:00
|
|
|
INIT_LIST_HEAD(&directory->playlists);
|
|
|
|
|
2004-06-23 05:33:35 +02:00
|
|
|
directory->parent = parent;
|
2008-10-13 09:55:00 +02:00
|
|
|
memcpy(directory->path, path, pathlen + 1);
|
2004-02-24 00:41:20 +01:00
|
|
|
|
|
|
|
return directory;
|
|
|
|
}
|
|
|
|
|
2008-10-08 10:48:48 +02:00
|
|
|
void
|
2008-10-08 11:07:58 +02:00
|
|
|
directory_free(struct directory *directory)
|
2006-07-20 18:02:40 +02:00
|
|
|
{
|
2010-07-25 13:31:39 +02:00
|
|
|
playlist_vector_deinit(&directory->playlists);
|
|
|
|
|
2012-01-24 21:33:09 +01:00
|
|
|
struct song *song, *ns;
|
|
|
|
directory_for_each_song_safe(song, ns, directory)
|
|
|
|
song_free(song);
|
2008-10-31 09:20:02 +01:00
|
|
|
|
2012-01-24 18:20:58 +01:00
|
|
|
struct directory *child, *n;
|
|
|
|
directory_for_each_child_safe(child, n, directory)
|
|
|
|
directory_free(child);
|
2008-10-31 09:20:02 +01:00
|
|
|
|
2009-01-25 18:47:21 +01:00
|
|
|
g_free(directory);
|
2004-11-12 18:38:52 +01:00
|
|
|
/* this resets last dir returned */
|
2008-10-08 11:07:58 +02:00
|
|
|
/*directory_get_path(NULL); */
|
2004-02-24 00:41:20 +01:00
|
|
|
}
|
|
|
|
|
2012-01-24 19:07:11 +01:00
|
|
|
void
|
|
|
|
directory_delete(struct directory *directory)
|
|
|
|
{
|
2012-01-31 22:12:14 +01:00
|
|
|
assert(holding_db_lock());
|
2012-01-24 19:07:11 +01:00
|
|
|
assert(directory != NULL);
|
|
|
|
assert(directory->parent != NULL);
|
|
|
|
|
2012-01-24 18:20:58 +01:00
|
|
|
list_del(&directory->siblings);
|
2012-01-24 19:07:11 +01:00
|
|
|
directory_free(directory);
|
|
|
|
}
|
|
|
|
|
2008-10-13 16:32:39 +02:00
|
|
|
const char *
|
|
|
|
directory_get_name(const struct directory *directory)
|
|
|
|
{
|
2012-04-04 19:08:05 +02:00
|
|
|
assert(!directory_is_root(directory));
|
|
|
|
assert(directory->path != NULL);
|
|
|
|
|
|
|
|
const char *slash = strrchr(directory->path, '/');
|
|
|
|
assert((slash == NULL) == directory_is_root(directory->parent));
|
|
|
|
|
|
|
|
return slash != NULL
|
|
|
|
? slash + 1
|
|
|
|
: directory->path;
|
2008-10-13 16:32:39 +02:00
|
|
|
}
|
|
|
|
|
2012-01-24 19:07:11 +01:00
|
|
|
struct directory *
|
|
|
|
directory_new_child(struct directory *parent, const char *name_utf8)
|
|
|
|
{
|
2012-01-31 22:12:14 +01:00
|
|
|
assert(holding_db_lock());
|
2012-01-24 19:07:11 +01:00
|
|
|
assert(parent != NULL);
|
|
|
|
assert(name_utf8 != NULL);
|
|
|
|
assert(*name_utf8 != 0);
|
|
|
|
|
|
|
|
char *allocated;
|
|
|
|
const char *path_utf8;
|
|
|
|
if (directory_is_root(parent)) {
|
|
|
|
allocated = NULL;
|
|
|
|
path_utf8 = name_utf8;
|
|
|
|
} else {
|
|
|
|
allocated = g_strconcat(directory_get_path(parent),
|
|
|
|
"/", name_utf8, NULL);
|
|
|
|
path_utf8 = allocated;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct directory *directory = directory_new(path_utf8, parent);
|
|
|
|
g_free(allocated);
|
|
|
|
|
2012-02-13 14:44:28 +01:00
|
|
|
list_add_tail(&directory->siblings, &parent->children);
|
2012-01-24 19:07:11 +01:00
|
|
|
return directory;
|
|
|
|
}
|
|
|
|
|
2012-01-24 18:20:58 +01:00
|
|
|
struct directory *
|
|
|
|
directory_get_child(const struct directory *directory, const char *name)
|
2006-07-20 18:02:40 +02:00
|
|
|
{
|
2012-01-31 22:12:14 +01:00
|
|
|
assert(holding_db_lock());
|
2008-09-29 13:11:40 +02:00
|
|
|
|
2012-01-24 18:20:58 +01:00
|
|
|
struct directory *child;
|
2012-01-31 22:12:14 +01:00
|
|
|
directory_for_each_child(child, directory)
|
|
|
|
if (strcmp(directory_get_name(child), name) == 0)
|
2012-01-24 18:20:58 +01:00
|
|
|
return child;
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
2009-08-14 11:52:00 +02:00
|
|
|
|
2012-01-24 18:20:58 +01:00
|
|
|
void
|
|
|
|
directory_prune_empty(struct directory *directory)
|
|
|
|
{
|
2012-01-31 22:12:14 +01:00
|
|
|
assert(holding_db_lock());
|
|
|
|
|
2012-01-24 18:20:58 +01:00
|
|
|
struct directory *child, *n;
|
|
|
|
directory_for_each_child_safe(child, n, directory) {
|
2009-08-14 11:52:00 +02:00
|
|
|
directory_prune_empty(child);
|
|
|
|
|
2012-01-24 19:07:11 +01:00
|
|
|
if (directory_is_empty(child))
|
|
|
|
directory_delete(child);
|
2004-03-09 23:48:35 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-10-08 10:49:05 +02:00
|
|
|
struct directory *
|
2009-04-01 18:41:33 +02:00
|
|
|
directory_lookup_directory(struct directory *directory, const char *uri)
|
2004-04-14 04:35:29 +02:00
|
|
|
{
|
2012-01-31 22:12:14 +01:00
|
|
|
assert(holding_db_lock());
|
2009-04-01 18:41:33 +02:00
|
|
|
assert(uri != NULL);
|
2008-10-08 11:06:44 +02:00
|
|
|
|
2009-04-01 18:41:33 +02:00
|
|
|
if (isRootDirectory(uri))
|
2004-02-24 00:41:20 +01:00
|
|
|
return directory;
|
|
|
|
|
2012-01-29 14:42:28 +01:00
|
|
|
char *duplicated = g_strdup(uri), *name = duplicated;
|
2012-01-31 22:12:14 +01:00
|
|
|
|
2008-09-29 13:11:40 +02:00
|
|
|
while (1) {
|
2012-01-29 14:42:28 +01:00
|
|
|
char *slash = strchr(name, '/');
|
|
|
|
if (slash == name) {
|
|
|
|
directory = NULL;
|
2008-09-29 13:11:40 +02:00
|
|
|
break;
|
2012-01-29 14:42:28 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
if (slash != NULL)
|
|
|
|
*slash = '\0';
|
|
|
|
|
|
|
|
directory = directory_get_child(directory, name);
|
|
|
|
if (directory == NULL || slash == NULL)
|
2008-09-29 13:11:40 +02:00
|
|
|
break;
|
2012-01-29 14:42:28 +01:00
|
|
|
|
|
|
|
name = slash + 1;
|
2008-09-29 13:11:40 +02:00
|
|
|
}
|
2004-02-24 00:41:20 +01:00
|
|
|
|
2009-01-25 18:47:21 +01:00
|
|
|
g_free(duplicated);
|
2004-04-14 04:35:29 +02:00
|
|
|
|
2012-01-29 14:42:28 +01:00
|
|
|
return directory;
|
2004-04-14 04:35:29 +02:00
|
|
|
}
|
|
|
|
|
2012-01-24 21:38:31 +01:00
|
|
|
void
|
|
|
|
directory_add_song(struct directory *directory, struct song *song)
|
|
|
|
{
|
2012-06-13 21:23:34 +02:00
|
|
|
assert(holding_db_lock());
|
2012-01-24 21:38:31 +01:00
|
|
|
assert(directory != NULL);
|
|
|
|
assert(song != NULL);
|
|
|
|
assert(song->parent == directory);
|
|
|
|
|
2012-02-02 09:59:31 +01:00
|
|
|
list_add_tail(&song->siblings, &directory->songs);
|
2012-01-24 21:38:31 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2012-01-24 22:27:42 +01:00
|
|
|
directory_remove_song(G_GNUC_UNUSED struct directory *directory,
|
|
|
|
struct song *song)
|
2012-01-24 21:38:31 +01:00
|
|
|
{
|
2012-06-13 21:23:34 +02:00
|
|
|
assert(holding_db_lock());
|
2012-01-24 21:38:31 +01:00
|
|
|
assert(directory != NULL);
|
|
|
|
assert(song != NULL);
|
|
|
|
assert(song->parent == directory);
|
|
|
|
|
2012-01-24 21:33:09 +01:00
|
|
|
list_del(&song->siblings);
|
2012-01-24 21:38:31 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
struct song *
|
|
|
|
directory_get_song(const struct directory *directory, const char *name_utf8)
|
|
|
|
{
|
2012-01-31 22:12:14 +01:00
|
|
|
assert(holding_db_lock());
|
2012-01-24 21:38:31 +01:00
|
|
|
assert(directory != NULL);
|
|
|
|
assert(name_utf8 != NULL);
|
|
|
|
|
2012-01-24 21:33:09 +01:00
|
|
|
struct song *song;
|
|
|
|
directory_for_each_song(song, directory) {
|
|
|
|
assert(song->parent == directory);
|
|
|
|
|
2012-01-31 22:12:14 +01:00
|
|
|
if (strcmp(song->uri, name_utf8) == 0)
|
2012-01-24 21:33:09 +01:00
|
|
|
return song;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
2012-01-24 21:38:31 +01:00
|
|
|
}
|
|
|
|
|
2009-04-01 18:41:37 +02:00
|
|
|
struct song *
|
|
|
|
directory_lookup_song(struct directory *directory, const char *uri)
|
|
|
|
{
|
|
|
|
char *duplicated, *base;
|
|
|
|
|
2012-01-31 22:12:14 +01:00
|
|
|
assert(holding_db_lock());
|
2009-04-01 18:41:37 +02:00
|
|
|
assert(directory != NULL);
|
|
|
|
assert(uri != NULL);
|
|
|
|
|
|
|
|
duplicated = g_strdup(uri);
|
|
|
|
base = strrchr(duplicated, '/');
|
|
|
|
|
|
|
|
if (base != NULL) {
|
|
|
|
*base++ = 0;
|
|
|
|
directory = directory_lookup_directory(directory, duplicated);
|
|
|
|
if (directory == NULL) {
|
|
|
|
g_free(duplicated);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
base = duplicated;
|
|
|
|
|
2012-01-24 21:38:31 +01:00
|
|
|
struct song *song = directory_get_song(directory, base);
|
2009-04-01 18:41:37 +02:00
|
|
|
assert(song == NULL || song->parent == directory);
|
|
|
|
|
|
|
|
g_free(duplicated);
|
|
|
|
return song;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2012-01-24 18:20:58 +01:00
|
|
|
static int
|
|
|
|
directory_cmp(G_GNUC_UNUSED void *priv,
|
|
|
|
struct list_head *_a, struct list_head *_b)
|
|
|
|
{
|
|
|
|
const struct directory *a = (const struct directory *)_a;
|
|
|
|
const struct directory *b = (const struct directory *)_b;
|
|
|
|
return g_utf8_collate(a->path, b->path);
|
|
|
|
}
|
|
|
|
|
2008-10-08 10:48:48 +02:00
|
|
|
void
|
2008-10-08 11:07:58 +02:00
|
|
|
directory_sort(struct directory *directory)
|
2006-07-20 18:02:40 +02:00
|
|
|
{
|
2012-01-31 22:12:14 +01:00
|
|
|
assert(holding_db_lock());
|
|
|
|
|
2012-01-24 18:20:58 +01:00
|
|
|
list_sort(NULL, &directory->children, directory_cmp);
|
2012-01-24 21:33:09 +01:00
|
|
|
song_list_sort(&directory->songs);
|
2006-07-20 18:02:40 +02:00
|
|
|
|
2012-01-24 18:20:58 +01:00
|
|
|
struct directory *child;
|
|
|
|
directory_for_each_child(child, directory)
|
|
|
|
directory_sort(child);
|
2004-02-24 00:41:20 +01:00
|
|
|
}
|
|
|
|
|
2011-09-10 19:24:30 +02:00
|
|
|
bool
|
2012-07-30 07:26:08 +02:00
|
|
|
directory::Walk(bool recursive,
|
|
|
|
VisitDirectory visit_directory, VisitSong visit_song,
|
|
|
|
VisitPlaylist visit_playlist,
|
|
|
|
GError **error_r) const
|
2004-02-24 00:41:20 +01:00
|
|
|
{
|
2011-09-10 19:24:30 +02:00
|
|
|
assert(error_r == NULL || *error_r == NULL);
|
|
|
|
|
2012-07-30 07:26:08 +02:00
|
|
|
if (visit_song) {
|
2012-01-24 21:33:09 +01:00
|
|
|
struct song *song;
|
2012-07-30 07:26:08 +02:00
|
|
|
directory_for_each_song(song, this)
|
|
|
|
if (!visit_song(song, error_r))
|
2011-09-10 19:24:30 +02:00
|
|
|
return false;
|
2006-07-20 18:02:40 +02:00
|
|
|
}
|
|
|
|
|
2012-07-30 07:26:08 +02:00
|
|
|
if (visit_playlist) {
|
2012-02-12 17:50:30 +01:00
|
|
|
struct playlist_metadata *i;
|
2012-07-30 07:26:08 +02:00
|
|
|
directory_for_each_playlist(i, this)
|
|
|
|
if (!visit_playlist(i, this, error_r))
|
2011-09-13 22:02:37 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2012-01-24 18:20:58 +01:00
|
|
|
struct directory *child;
|
2012-07-30 07:26:08 +02:00
|
|
|
directory_for_each_child(child, this) {
|
|
|
|
if (visit_directory &&
|
|
|
|
!visit_directory(child, error_r))
|
2011-09-13 20:38:12 +02:00
|
|
|
return false;
|
|
|
|
|
2011-09-10 18:48:10 +02:00
|
|
|
if (recursive &&
|
2012-07-30 07:26:08 +02:00
|
|
|
!child->Walk(recursive, visit_directory, visit_song,
|
|
|
|
visit_playlist, error_r))
|
2011-09-13 20:41:06 +02:00
|
|
|
return false;
|
2011-09-10 19:24:30 +02:00
|
|
|
}
|
2006-07-20 18:02:40 +02:00
|
|
|
|
2011-09-10 19:24:30 +02:00
|
|
|
return true;
|
2004-02-24 00:41:20 +01:00
|
|
|
}
|