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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
/*
* Copyright (C) 2003-2006 RevConnect, http://www.revconnect.com
*
* 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, see <https://www.gnu.org/licenses/>.
*/
#include "stdinc.h"
#include "SearchQueue.h"
#include "TimerManager.h"
#include "QueueManager.h"
#include "SearchManager.h"
namespace dcpp {
bool SearchQueue::add(const SearchCore& s)
{
dcassert(s.owners.size() == 1);
Lock l(cs);
for(auto i = searchQueue.begin(); i != searchQueue.end(); ++i)
{
// check dupe
if(*i == s) {
void* aOwner = *s.owners.begin();
i->owners.insert(aOwner);
// if previous search was autosearch and current one isn't, it should be readded before autosearches
if(s.token != "auto" && i->token == "auto")
{
searchQueue.erase(i);
break;
}
return false;
}
}
if(s.token == "auto") {
// Insert last (automatic search)
searchQueue.push_back(s);
} else {
bool added = false;
if(searchQueue.empty()) {
searchQueue.push_front(s);
added = true;
} else {
// Insert before the automatic searches (manual search)
for(auto i = searchQueue.begin(); i != searchQueue.end(); ++i) {
if(i->token == "auto") {
searchQueue.insert(i, s);
added = true;
break;
}
}
}
if (!added) {
searchQueue.push_back(s);
}
}
return true;
}
bool SearchQueue::pop(SearchCore& s, uint64_t now)
{
dcassert(interval);
//uint64_t now = GET_TICK();
if(now <= lastSearchTime + interval && lastSearchTime > 0)
return false;
{
Lock l(cs);
if(!searchQueue.empty()){
s = searchQueue.front();
searchQueue.pop_front();
lastSearchTime = now;
return true;
}
}
return false;
}
uint64_t SearchQueue::getSearchTime(void* aOwner, uint64_t now) {
if(aOwner == 0) return 0xFFFFFFFF;
uint64_t x = max(lastSearchTime, now - interval);
for(auto i = searchQueue.cbegin(); i != searchQueue.cend(); ++i){
x += interval;
if(i->owners.find(aOwner) != i->owners.end())
return x;
else if(i->owners.empty())
break;
}
return 0;
}
bool SearchQueue::cancelSearch(void* aOwner){
dcassert(aOwner);
Lock l(cs);
for(auto i = searchQueue.begin(); i != searchQueue.end(); ++i){
const auto j = i->owners.find(aOwner);
if(j != i->owners.end()){
i->owners.erase(j);
if(i->owners.empty())
searchQueue.erase(i);
return true;
}
}
return false;
}
}
|
