Queue.cxx 1.67 KB
Newer Older
1
/*
Max Kellermann's avatar
Max Kellermann committed
2
 * Copyright 2003-2020 The Music Player Daemon Project
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
 * 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.
 */

20
#include "Queue.hxx"
21

22
bool
Max Kellermann's avatar
Max Kellermann committed
23
UpdateQueue::Push(SimpleDatabase &db, Storage &storage,
24
		  const char *path, bool discard, unsigned id) noexcept
25
{
26
	if (update_queue.size() >= MAX_UPDATE_QUEUE_SIZE)
27
		return false;
28

Max Kellermann's avatar
Max Kellermann committed
29
	update_queue.emplace_back(db, storage, path, discard, id);
30
	return true;
31 32
}

33
UpdateQueueItem
34
UpdateQueue::Pop() noexcept
35
{
36 37
	if (update_queue.empty())
		return UpdateQueueItem();
38

39
	auto i = std::move(update_queue.front());
40
	update_queue.pop_front();
41
	return i;
42
}
Max Kellermann's avatar
Max Kellermann committed
43 44

void
45
UpdateQueue::Erase(SimpleDatabase &db) noexcept
Max Kellermann's avatar
Max Kellermann committed
46 47 48 49 50 51 52 53 54 55 56
{
	for (auto i = update_queue.begin(), end = update_queue.end();
	     i != end;) {
		if (i->db == &db)
			i = update_queue.erase(i);
		else
			++i;
	}
}

void
57
UpdateQueue::Erase(Storage &storage) noexcept
Max Kellermann's avatar
Max Kellermann committed
58 59 60 61 62 63 64 65 66
{
	for (auto i = update_queue.begin(), end = update_queue.end();
	     i != end;) {
		if (i->storage == &storage)
			i = update_queue.erase(i);
		else
			++i;
	}
}