1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
/*
* Copyright (C) 2003-2014 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 "Queue.hxx"
bool
UpdateQueue::Push(SimpleDatabase &db, Storage &storage,
const char *path, bool discard, unsigned id)
{
if (update_queue.size() >= MAX_UPDATE_QUEUE_SIZE)
return false;
update_queue.emplace_back(db, storage, path, discard, id);
return true;
}
UpdateQueueItem
UpdateQueue::Pop()
{
if (update_queue.empty())
return UpdateQueueItem();
auto i = std::move(update_queue.front());
update_queue.pop_front();
return i;
}
void
UpdateQueue::Erase(SimpleDatabase &db)
{
for (auto i = update_queue.begin(), end = update_queue.end();
i != end;) {
if (i->db == &db)
i = update_queue.erase(i);
else
++i;
}
}
void
UpdateQueue::Erase(Storage &storage)
{
for (auto i = update_queue.begin(), end = update_queue.end();
i != end;) {
if (i->storage == &storage)
i = update_queue.erase(i);
else
++i;
}
}
|
