blob: 76ea9dec514ae302fbd9502818b88c927db7a1fc (
plain)
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
|
/*
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*
*/
#include "CompletionTracker.h"
#include <algorithm>
using qpid::client::CompletionTracker;
using namespace qpid::framing;
using namespace boost;
namespace
{
const std::string empty;
}
CompletionTracker::CompletionTracker() : closed(false) {}
CompletionTracker::CompletionTracker(const SequenceNumber& m) : mark(m) {}
void CompletionTracker::close()
{
sys::Mutex::ScopedLock l(lock);
closed=true;
while (!listeners.empty()) {
Record r(listeners.front());
{
sys::Mutex::ScopedUnlock u(lock);
r.completed();
}
listeners.pop_front();
}
}
void CompletionTracker::completed(const SequenceNumber& _mark)
{
sys::Mutex::ScopedLock l(lock);
mark = _mark;
while (!listeners.empty() && !(listeners.front().id > mark)) {
Record r(listeners.front());
listeners.pop_front();
{
sys::Mutex::ScopedUnlock u(lock);
r.completed();
}
}
}
void CompletionTracker::received(const SequenceNumber& id, const std::string& result)
{
sys::Mutex::ScopedLock l(lock);
Listeners::iterator i = seek(id);
if (i != listeners.end() && i->id == id) {
i->received(result);
listeners.erase(i);
}
}
void CompletionTracker::listenForCompletion(const SequenceNumber& point, CompletionListener listener)
{
if (!add(Record(point, listener))) {
listener();
}
}
void CompletionTracker::listenForResult(const SequenceNumber& point, ResultListener listener)
{
if (!add(Record(point, listener))) {
listener(empty);
}
}
bool CompletionTracker::add(const Record& record)
{
sys::Mutex::ScopedLock l(lock);
if (record.id <= mark || closed) {
return false;
} else {
//insert at the correct position
Listeners::iterator i = seek(record.id);
if (i == listeners.end()) i = listeners.begin();
listeners.insert(i, record);
return true;
}
}
CompletionTracker::Listeners::iterator CompletionTracker::seek(const framing::SequenceNumber& point)
{
Listeners::iterator i = listeners.begin();
while (i != listeners.end() && i->id < point) i++;
return i;
}
void CompletionTracker::Record::completed()
{
if (f) f();
else if(g) g(empty);//won't get a result if command is now complete
}
void CompletionTracker::Record::received(const std::string& result)
{
if (g) g(result);
}
|
