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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
|
/*
*
* 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.
*
*/
package org.apache.qpid.server.ack;
import java.util.Collection;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Set;
import org.apache.qpid.AMQException;
import org.apache.qpid.server.queue.QueueEntry;
public class UnacknowledgedMessageMapImpl implements UnacknowledgedMessageMap
{
private final Object _lock = new Object();
private long _unackedSize;
private Map<Long, QueueEntry> _map;
private long _lastDeliveryTag;
private final int _prefetchLimit;
public UnacknowledgedMessageMapImpl(int prefetchLimit)
{
_prefetchLimit = prefetchLimit;
_map = new LinkedHashMap<Long, QueueEntry>(prefetchLimit);
}
public void collect(long deliveryTag, boolean multiple, Map<Long, QueueEntry> msgs)
{
if (multiple)
{
collect(deliveryTag, msgs);
}
else
{
final QueueEntry entry = get(deliveryTag);
if(entry != null)
{
msgs.put(deliveryTag, entry);
}
}
}
public void remove(Map<Long,QueueEntry> msgs)
{
synchronized (_lock)
{
for (Long deliveryTag : msgs.keySet())
{
remove(deliveryTag);
}
}
}
public QueueEntry remove(long deliveryTag)
{
synchronized (_lock)
{
QueueEntry message = _map.remove(deliveryTag);
if(message != null)
{
_unackedSize -= message.getMessage().getSize();
}
return message;
}
}
public void visit(Visitor visitor) throws AMQException
{
synchronized (_lock)
{
Set<Map.Entry<Long, QueueEntry>> currentEntries = _map.entrySet();
for (Map.Entry<Long, QueueEntry> entry : currentEntries)
{
visitor.callback(entry.getKey().longValue(), entry.getValue());
}
visitor.visitComplete();
}
}
public void add(long deliveryTag, QueueEntry message)
{
synchronized (_lock)
{
_map.put(deliveryTag, message);
_unackedSize += message.getMessage().getSize();
_lastDeliveryTag = deliveryTag;
}
}
public Collection<QueueEntry> cancelAllMessages()
{
synchronized (_lock)
{
Collection<QueueEntry> currentEntries = _map.values();
_map = new LinkedHashMap<Long, QueueEntry>(_prefetchLimit);
_unackedSize = 0l;
return currentEntries;
}
}
public int size()
{
synchronized (_lock)
{
return _map.size();
}
}
public void clear()
{
synchronized (_lock)
{
_map.clear();
_unackedSize = 0l;
}
}
public QueueEntry get(long key)
{
synchronized (_lock)
{
return _map.get(key);
}
}
public Set<Long> getDeliveryTags()
{
synchronized (_lock)
{
return _map.keySet();
}
}
public Collection<QueueEntry> acknowledge(long deliveryTag, boolean multiple)
{
Map<Long, QueueEntry> ackedMessageMap = new LinkedHashMap<Long,QueueEntry>();
collect(deliveryTag, multiple, ackedMessageMap);
remove(ackedMessageMap);
return ackedMessageMap.values();
}
private void collect(long key, Map<Long, QueueEntry> msgs)
{
synchronized (_lock)
{
for (Map.Entry<Long, QueueEntry> entry : _map.entrySet())
{
msgs.put(entry.getKey(),entry.getValue());
if (entry.getKey() == key)
{
break;
}
}
}
}
}
|
