PlaylistPrint.cxx 4.63 KB
Newer Older
1
/*
2
 * Copyright (C) 2003-2013 The Music Player Daemon Project
3 4 5 6 7 8 9 10 11 12 13
 * 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.
14 15 16 17
 *
 * 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.
18 19
 */

20
#include "config.h"
21
#include "PlaylistPrint.hxx"
Max Kellermann's avatar
Max Kellermann committed
22
#include "PlaylistFile.hxx"
23 24
#include "PlaylistAny.hxx"
#include "PlaylistSong.hxx"
25
#include "Playlist.hxx"
26
#include "QueuePrint.hxx"
Max Kellermann's avatar
Max Kellermann committed
27
#include "SongPrint.hxx"
28 29
#include "DatabaseGlue.hxx"
#include "DatabasePlugin.hxx"
Max Kellermann's avatar
Max Kellermann committed
30
#include "Client.hxx"
31
#include "input_stream.h"
32 33

extern "C" {
34 35
#include "playlist_list.h"
#include "playlist_plugin.h"
36
#include "song.h"
37
}
38

39
void
40
playlist_print_uris(Client *client, const struct playlist *playlist)
41 42 43
{
	const struct queue *queue = &playlist->queue;

44
	queue_print_uris(client, queue, 0, queue->GetLength());
45 46 47
}

bool
48
playlist_print_info(Client *client, const struct playlist *playlist,
49 50 51 52
		    unsigned start, unsigned end)
{
	const struct queue *queue = &playlist->queue;

53
	if (end > queue->GetLength())
54
		/* correct the "end" offset */
55
		end = queue->GetLength();
56 57 58 59 60 61 62 63 64 65

	if (start > end)
		/* an invalid "start" offset is fatal */
		return false;

	queue_print_info(client, queue, start, end);
	return true;
}

bool
66
playlist_print_id(Client *client, const struct playlist *playlist,
67 68 69 70 71
		  unsigned id)
{
	const struct queue *queue = &playlist->queue;
	int position;

72
	position = queue->IdToPosition(id);
73 74 75 76 77 78 79 80
	if (position < 0)
		/* no such song */
		return false;

	return playlist_print_info(client, playlist, position, position + 1);
}

bool
81
playlist_print_current(Client *client, const struct playlist *playlist)
82
{
83
	int current_position = playlist->GetCurrentPosition();
84 85 86 87 88 89 90 91 92
	if (current_position < 0)
		return false;

	queue_print_info(client, &playlist->queue,
			 current_position, current_position + 1);
	return true;
}

void
93
playlist_print_find(Client *client, const struct playlist *playlist,
94
		    const SongFilter &filter)
95
{
96
	queue_find(client, &playlist->queue, filter);
97 98 99
}

void
100
playlist_print_changes_info(Client *client,
101 102 103 104 105 106 107
			    const struct playlist *playlist,
			    uint32_t version)
{
	queue_print_changes_info(client, &playlist->queue, version);
}

void
108
playlist_print_changes_position(Client *client,
109 110 111 112 113 114
				const struct playlist *playlist,
				uint32_t version)
{
	queue_print_changes_position(client, &playlist->queue, version);
}

115
static bool
116
PrintSongDetails(Client *client, const char *uri_utf8)
117 118 119 120 121 122 123 124 125 126 127 128 129 130
{
	const Database *db = GetDatabase(nullptr);
	if (db == nullptr)
		return false;

	song *song = db->GetSong(uri_utf8, nullptr);
	if (song == nullptr)
		return false;

	song_print_info(client, song);
	db->ReturnSong(song);
	return true;
}

131
bool
132
spl_print(Client *client, const char *name_utf8, bool detail,
133
	  GError **error_r)
134
{
135 136 137 138
	GError *error = NULL;
	PlaylistFileContents contents = LoadPlaylistFile(name_utf8, &error);
	if (contents.empty() && error != nullptr) {
		g_propagate_error(error_r, error);
139
		return false;
140
	}
141

142
	for (const auto &uri_utf8 : contents) {
143
		if (!detail || !PrintSongDetails(client, uri_utf8.c_str()))
144 145
			client_printf(client, SONG_FILE "%s\n",
				      uri_utf8.c_str());
146 147
	}

148
	return true;
149
}
150 151

static void
152
playlist_provider_print(Client *client, const char *uri,
153 154 155 156 157 158
			struct playlist_provider *playlist, bool detail)
{
	struct song *song;
	char *base_uri = uri != NULL ? g_path_get_dirname(uri) : NULL;

	while ((song = playlist_plugin_read(playlist)) != NULL) {
159
		song = playlist_check_translate_song(song, base_uri, false);
160 161 162 163 164 165 166
		if (song == NULL)
			continue;

		if (detail)
			song_print_info(client, song);
		else
			song_print_uri(client, song);
167

168
		song_free(song);
169 170 171 172 173 174
	}

	g_free(base_uri);
}

bool
175
playlist_file_print(Client *client, const char *uri, bool detail)
176
{
177 178 179
	GMutex *mutex = g_mutex_new();
	GCond *cond = g_cond_new();

180
	struct input_stream *is;
181 182 183 184 185
	struct playlist_provider *playlist =
		playlist_open_any(uri, mutex, cond, &is);
	if (playlist == NULL) {
		g_cond_free(cond);
		g_mutex_free(mutex);
186
		return false;
187
	}
188 189 190

	playlist_provider_print(client, uri, playlist, detail);
	playlist_plugin_close(playlist);
191 192 193 194

	if (is != NULL)
		input_stream_close(is);

195 196 197
	g_cond_free(cond);
	g_mutex_free(mutex);

198 199
	return true;
}