141 lines
3.4 KiB
C
141 lines
3.4 KiB
C
/*
|
|
* Copyright (C) 2003-2009 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 "playlist_print.h"
|
|
#include "queue_print.h"
|
|
#include "stored_playlist.h"
|
|
#include "song_print.h"
|
|
#include "song.h"
|
|
#include "database.h"
|
|
#include "client.h"
|
|
|
|
void
|
|
playlist_print_uris(struct client *client, const struct playlist *playlist)
|
|
{
|
|
const struct queue *queue = &playlist->queue;
|
|
|
|
queue_print_uris(client, queue, 0, queue_length(queue));
|
|
}
|
|
|
|
bool
|
|
playlist_print_info(struct client *client, const struct playlist *playlist,
|
|
unsigned start, unsigned end)
|
|
{
|
|
const struct queue *queue = &playlist->queue;
|
|
|
|
if (end > queue_length(queue))
|
|
/* correct the "end" offset */
|
|
end = queue_length(queue);
|
|
|
|
if (start > end)
|
|
/* an invalid "start" offset is fatal */
|
|
return false;
|
|
|
|
queue_print_info(client, queue, start, end);
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
playlist_print_id(struct client *client, const struct playlist *playlist,
|
|
unsigned id)
|
|
{
|
|
const struct queue *queue = &playlist->queue;
|
|
int position;
|
|
|
|
position = queue_id_to_position(queue, id);
|
|
if (position < 0)
|
|
/* no such song */
|
|
return false;
|
|
|
|
return playlist_print_info(client, playlist, position, position + 1);
|
|
}
|
|
|
|
bool
|
|
playlist_print_current(struct client *client, const struct playlist *playlist)
|
|
{
|
|
int current_position = playlist_get_current_song(playlist);
|
|
|
|
if (current_position < 0)
|
|
return false;
|
|
|
|
queue_print_info(client, &playlist->queue,
|
|
current_position, current_position + 1);
|
|
return true;
|
|
}
|
|
|
|
void
|
|
playlist_print_find(struct client *client, const struct playlist *playlist,
|
|
const struct locate_item_list *list)
|
|
{
|
|
queue_find(client, &playlist->queue, list);
|
|
}
|
|
|
|
void
|
|
playlist_print_search(struct client *client, const struct playlist *playlist,
|
|
const struct locate_item_list *list)
|
|
{
|
|
queue_search(client, &playlist->queue, list);
|
|
}
|
|
|
|
void
|
|
playlist_print_changes_info(struct client *client,
|
|
const struct playlist *playlist,
|
|
uint32_t version)
|
|
{
|
|
queue_print_changes_info(client, &playlist->queue, version);
|
|
}
|
|
|
|
void
|
|
playlist_print_changes_position(struct client *client,
|
|
const struct playlist *playlist,
|
|
uint32_t version)
|
|
{
|
|
queue_print_changes_position(client, &playlist->queue, version);
|
|
}
|
|
|
|
bool
|
|
spl_print(struct client *client, const char *name_utf8, bool detail)
|
|
{
|
|
GPtrArray *list;
|
|
|
|
list = spl_load(name_utf8);
|
|
if (list == NULL)
|
|
return false;
|
|
|
|
for (unsigned i = 0; i < list->len; ++i) {
|
|
const char *temp = g_ptr_array_index(list, i);
|
|
bool wrote = false;
|
|
|
|
if (detail) {
|
|
struct song *song = db_get_song(temp);
|
|
if (song) {
|
|
song_print_info(client, song);
|
|
wrote = true;
|
|
}
|
|
}
|
|
|
|
if (!wrote) {
|
|
client_printf(client, SONG_FILE "%s\n", temp);
|
|
}
|
|
}
|
|
|
|
spl_free(list);
|
|
return true;
|
|
}
|