/* the Music Player Daemon (MPD) * Copyright (C) 2003-2007 by Warren Dukes (warren.dukes@gmail.com) * This project's homepage is: 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include "directory.h" #include "database.h" #include "song.h" #include "log.h" #include "path.h" #include "utils.h" #include "client.h" #include "song_print.h" #include "song_save.h" #include "dirvec.h" struct directory * directory_new(const char *dirname, struct directory *parent) { struct directory *directory; assert(dirname != NULL); assert((*dirname == 0) == (parent == NULL)); directory = xcalloc(1, sizeof(*directory)); directory->path = xstrdup(dirname); directory->parent = parent; return directory; } void directory_free(struct directory *directory) { dirvec_destroy(&directory->children); songvec_destroy(&directory->songs); free(directory->path); free(directory); /* this resets last dir returned */ /*directory_get_path(NULL); */ } void directory_prune_empty(struct directory *directory) { int i; struct dirvec *dv = &directory->children; for (i = dv->nr; --i >= 0; ) { directory_prune_empty(dv->base[i]); if (directory_is_empty(dv->base[i])) dirvec_delete(dv, dv->base[i]); } if (!dv->nr) dirvec_destroy(dv); } struct directory * directory_get_directory(struct directory *directory, const char *name) { struct directory *cur = directory; struct directory *found = NULL; char *duplicated; char *locate; assert(name != NULL); if (isRootDirectory(name)) return directory; duplicated = xstrdup(name); locate = strchr(duplicated, '/'); while (1) { if (locate) *locate = '\0'; if (!(found = dirvec_find(&cur->children, duplicated))) break; assert(cur == found->parent); cur = found; if (!locate) break; *locate = '/'; locate = strchr(locate + 1, '/'); } free(duplicated); return found; } static int dirvec_print(struct client *client, const struct dirvec *dv) { size_t i; for (i = 0; i < dv->nr; ++i) { client_printf(client, DIRECTORY_DIR "%s\n", directory_get_path(dv->base[i])); } return 0; } int directory_print(struct client *client, const struct directory *directory) { dirvec_print(client, &directory->children); songvec_print(client, &directory->songs); return 0; } /* TODO error checking */ int directory_save(FILE *fp, struct directory *directory) { struct dirvec *children = &directory->children; size_t i; int retv; if (!isRootDirectory(directory->path)) { retv = fprintf(fp, "%s%s\n", DIRECTORY_BEGIN, directory_get_path(directory)); if (retv < 0) return -1; } for (i = 0; i < children->nr; ++i) { struct directory *cur = children->base[i]; const char *base = mpd_basename(cur->path); retv = fprintf(fp, DIRECTORY_DIR "%s\n", base); if (retv < 0) return -1; if (directory_save(fp, cur) < 0) return -1; } songvec_save(fp, &directory->songs); if (!isRootDirectory(directory->path) && fprintf(fp, DIRECTORY_END "%s\n", directory_get_path(directory)) < 0) return -1; return 0; } void directory_load(FILE *fp, struct directory *directory) { char buffer[MPD_PATH_MAX * 2]; int bufferSize = MPD_PATH_MAX * 2; char key[MPD_PATH_MAX * 2]; char *name; while (myFgets(buffer, bufferSize, fp) && prefixcmp(buffer, DIRECTORY_END)) { if (!prefixcmp(buffer, DIRECTORY_DIR)) { struct directory *subdir; strcpy(key, &(buffer[strlen(DIRECTORY_DIR)])); if (!myFgets(buffer, bufferSize, fp)) FATAL("Error reading db, fgets\n"); /* for compatibility with db's prior to 0.11 */ if (!prefixcmp(buffer, DIRECTORY_MTIME)) { if (!myFgets(buffer, bufferSize, fp)) FATAL("Error reading db, fgets\n"); } if (prefixcmp(buffer, DIRECTORY_BEGIN)) FATAL("Error reading db at line: %s\n", buffer); name = &(buffer[strlen(DIRECTORY_BEGIN)]); if ((subdir = db_get_directory(name))) { assert(subdir->parent == directory); } else { subdir = directory_new(name, directory); dirvec_add(&directory->children, subdir); } directory_load(fp, subdir); } else if (!prefixcmp(buffer, SONG_BEGIN)) { readSongInfoIntoList(fp, &directory->songs, directory); } else { FATAL("Unknown line in db: %s\n", buffer); } } } void directory_sort(struct directory *directory) { int i; struct dirvec *dv = &directory->children; dirvec_sort(dv); songvec_sort(&directory->songs); for (i = dv->nr; --i >= 0; ) directory_sort(dv->base[i]); } int directory_walk(struct directory *directory, int (*forEachSong)(struct song *, void *), int (*forEachDir)(struct directory *, void *), void *data) { struct dirvec *dv = &directory->children; int err = 0; size_t j; if (forEachDir && (err = forEachDir(directory, data)) < 0) return err; if (forEachSong) { err = songvec_for_each(&directory->songs, forEachSong, data); if (err < 0) return err; } for (j = 0; err >= 0 && j < dv->nr; ++j) err = directory_walk(dv->base[j], forEachSong, forEachDir, data); return err; }