path: root/src/PlaylistVector.cxx

/*
 * 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 "PlaylistVector.hxx"
#include "DatabaseLock.hxx"

#include <assert.h>
#include <string.h>
#include <glib.h>

void
playlist_vector_deinit(struct list_head *pv)
{
	assert(pv != NULL);

	PlaylistInfo *pm, *n;
	playlist_vector_for_each_safe(pm, n, pv)
		delete pm;
}

PlaylistInfo *
playlist_vector_find(struct list_head *pv, const char *name)
{
	assert(holding_db_lock());
	assert(pv != NULL);
	assert(name != NULL);

	PlaylistInfo *pm;
	playlist_vector_for_each(pm, pv)
		if (pm->name.compare(name) == 0)
			return pm;

	return NULL;
}

void
playlist_vector_add(struct list_head *pv, PlaylistInfo &&pi)
{
	assert(holding_db_lock());

	PlaylistInfo *pm = new PlaylistInfo(std::move(pi));
	list_add_tail(&pm->siblings, pv);
}

bool
playlist_vector_update_or_add(struct list_head *pv, PlaylistInfo &&pi)
{
	assert(holding_db_lock());

	PlaylistInfo *pm = playlist_vector_find(pv, pi.name.c_str());
	if (pm != NULL) {
		if (pi.mtime == pm->mtime)
			return false;

		pm->mtime = pi.mtime;
	} else
		playlist_vector_add(pv, std::move(pi));

	return true;
}

bool
playlist_vector_remove(struct list_head *pv, const char *name)
{
	assert(holding_db_lock());

	PlaylistInfo *pm = playlist_vector_find(pv, name);
	if (pm == NULL)
		return false;

	list_del(&pm->siblings);
	delete pm;
	return true;
}