/* * 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 "Playlist.hxx" #include "song.h" #include "SongSave.hxx" #include "DatabasePlugin.hxx" #include "DatabaseGlue.hxx" #include "TextFile.hxx" extern "C" { #include "uri.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->GetLength(); i++) { uint8_t prio = queue->GetPriorityAtPosition(i); if (prio != 0) fprintf(fp, PRIO_LABEL "%u\n", prio); queue_save_song(fp, i, queue->Get(i)); } } void queue_load_song(TextFile &file, const char *line, queue *queue) { if (queue->IsFull()) return; uint8_t priority = 0; if (g_str_has_prefix(line, PRIO_LABEL)) { priority = strtoul(line + sizeof(PRIO_LABEL) - 1, NULL, 10); line = file.ReadLine(); if (line == NULL) return; } const Database *db = nullptr; struct song *song; 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(file, NULL, uri, &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; } const char *uri = endptr + 1; if (uri_has_scheme(uri)) { song = song_remote_new(uri); } else { db = GetDatabase(nullptr); if (db == nullptr) return; song = db->GetSong(uri, nullptr); if (song == nullptr) return; } } queue->Append(song, priority); if (db != nullptr) db->ReturnSong(song); }