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
|
package org.apache.qpid.server.queue;
import java.util.concurrent.atomic.AtomicReferenceFieldUpdater;
/*
*
* 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.
*
*/
public class SimpleQueueEntryList implements QueueEntryList
{
private final QueueEntryImpl _head;
private volatile QueueEntryImpl _tail;
static final AtomicReferenceFieldUpdater<SimpleQueueEntryList, QueueEntryImpl>
_tailUpdater =
AtomicReferenceFieldUpdater.newUpdater
(SimpleQueueEntryList.class, QueueEntryImpl.class, "_tail");
private final AMQQueue _queue;
static final AtomicReferenceFieldUpdater<QueueEntryImpl, QueueEntryImpl>
_nextUpdater =
AtomicReferenceFieldUpdater.newUpdater
(QueueEntryImpl.class, QueueEntryImpl.class, "_next");
public SimpleQueueEntryList(AMQQueue queue)
{
_queue = queue;
_head = new QueueEntryImpl(this);
_tail = _head;
}
void advanceHead()
{
QueueEntryImpl head = _head.nextNode();
while(head._next != null && head.isDeleted())
{
final QueueEntryImpl newhead = head.nextNode();
if(newhead != null)
{
_nextUpdater.compareAndSet(_head,head, newhead);
}
head = _head.nextNode();
}
}
public AMQQueue getQueue()
{
return _queue;
}
public QueueEntry add(AMQMessage message)
{
QueueEntryImpl node = new QueueEntryImpl(this, message);
for (;;)
{
QueueEntryImpl tail = _tail;
QueueEntryImpl next = tail.nextNode();
if (tail == _tail)
{
if (next == null)
{
node.setEntryId(tail.getEntryId()+1);
if (_nextUpdater.compareAndSet(tail, null, node))
{
_tailUpdater.compareAndSet(this, tail, node);
return node;
}
}
else
{
_tailUpdater.compareAndSet(this,tail, next);
}
}
}
}
public QueueEntry next(QueueEntry node)
{
return ((QueueEntryImpl)node).getNext();
}
public class QueueEntryIteratorImpl implements QueueEntryIterator
{
private QueueEntryImpl _lastNode;
QueueEntryIteratorImpl(QueueEntryImpl startNode)
{
_lastNode = startNode;
}
public boolean atTail()
{
return _lastNode.nextNode() == null;
}
public QueueEntry getNode()
{
return _lastNode;
}
public boolean advance()
{
if(!atTail())
{
QueueEntryImpl nextNode = _lastNode.nextNode();
while(nextNode.isDeleted() && nextNode.nextNode() != null)
{
nextNode = nextNode.nextNode();
}
_lastNode = nextNode;
return true;
}
else
{
return false;
}
}
}
public QueueEntryIterator iterator()
{
return new QueueEntryIteratorImpl(_head);
}
public QueueEntry getHead()
{
return _head;
}
static class Factory implements QueueEntryListFactory
{
public QueueEntryList createQueueEntryList(AMQQueue queue)
{
return new SimpleQueueEntryList(queue);
}
}
}
|
