aboutsummaryrefslogtreecommitdiffstats
path: root/src/QueueSave.cxx
diff options
context:
space:
mode:
Diffstat (limited to 'src/QueueSave.cxx')
-rw-r--r--src/QueueSave.cxx129
1 files changed, 129 insertions, 0 deletions
diff --git a/src/QueueSave.cxx b/src/QueueSave.cxx
new file mode 100644
index 000000000..96713c700
--- /dev/null
+++ b/src/QueueSave.cxx
@@ -0,0 +1,129 @@
+/*
+ * Copyright (C) 2003-2013 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 "config.h"
+#include "QueueSave.hxx"
+#include "song.h"
+#include "SongSave.hxx"
+
+extern "C" {
+#include "queue.h"
+#include "uri.h"
+#include "database.h"
+#include "text_file.h"
+}
+
+#include <stdlib.h>
+
+#define PRIO_LABEL "Prio: "
+
+static void
+queue_save_database_song(FILE *fp, int idx, const struct song *song)
+{
+ char *uri = song_get_uri(song);
+
+ fprintf(fp, "%i:%s\n", idx, uri);
+ g_free(uri);
+}
+
+static void
+queue_save_full_song(FILE *fp, const struct song *song)
+{
+ song_save(fp, song);
+}
+
+static void
+queue_save_song(FILE *fp, int idx, const struct song *song)
+{
+ if (song_in_database(song))
+ queue_save_database_song(fp, idx, song);
+ else
+ queue_save_full_song(fp, song);
+}
+
+void
+queue_save(FILE *fp, const struct queue *queue)
+{
+ for (unsigned i = 0; i < queue_length(queue); i++) {
+ uint8_t prio = queue_get_priority_at_position(queue, i);
+ if (prio != 0)
+ fprintf(fp, PRIO_LABEL "%u\n", prio);
+
+ queue_save_song(fp, i, queue_get(queue, i));
+ }
+}
+
+static struct song *
+get_song(const char *uri)
+{
+ return uri_has_scheme(uri)
+ ? song_remote_new(uri)
+ : db_get_song(uri);
+}
+
+void
+queue_load_song(FILE *fp, GString *buffer, const char *line,
+ struct queue *queue)
+{
+ struct song *song;
+
+ if (queue_is_full(queue))
+ return;
+
+ uint8_t priority = 0;
+ if (g_str_has_prefix(line, PRIO_LABEL)) {
+ priority = strtoul(line + sizeof(PRIO_LABEL) - 1, NULL, 10);
+
+ line = read_text_line(fp, buffer);
+ if (line == NULL)
+ return;
+ }
+
+ if (g_str_has_prefix(line, SONG_BEGIN)) {
+ const char *uri = line + sizeof(SONG_BEGIN) - 1;
+ if (!uri_has_scheme(uri) && !g_path_is_absolute(uri))
+ return;
+
+ GError *error = NULL;
+ song = song_load(fp, NULL, uri, buffer, &error);
+ if (song == NULL) {
+ g_warning("%s", error->message);
+ g_error_free(error);
+ return;
+ }
+ } else {
+ char *endptr;
+ long ret = strtol(line, &endptr, 10);
+ if (ret < 0 || *endptr != ':' || endptr[1] == 0) {
+ g_warning("Malformed playlist line in state file");
+ return;
+ }
+
+ line = endptr + 1;
+
+ song = get_song(line);
+ if (song == NULL)
+ return;
+ }
+
+ queue_append(queue, song, priority);
+
+ if (song_in_database(song))
+ db_return_song(song);
+}