2 * Copyright (c) 2015 Pantheon Technologies s.r.o. and others. All rights reserved.
4 * This program and the accompanying materials are made available under the
5 * terms of the Eclipse Public License v1.0 which accompanies this distribution,
6 * and is available at http://www.eclipse.org/legal/epl-v10.html
8 package org.opendaylight.openflowjava.protocol.impl.core.connection;
10 import com.google.common.base.Preconditions;
11 import com.google.common.base.Verify;
12 import com.google.common.util.concurrent.FutureCallback;
13 import java.util.concurrent.atomic.AtomicIntegerFieldUpdater;
14 import javax.annotation.Nonnull;
15 import org.opendaylight.openflowjava.protocol.api.connection.DeviceRequestFailedException;
16 import org.opendaylight.openflowjava.protocol.api.connection.OutboundQueue;
17 import org.opendaylight.openflowjava.protocol.api.connection.OutboundQueueException;
18 import org.opendaylight.yang.gen.v1.urn.opendaylight.openflow.protocol.rev130731.Error;
19 import org.opendaylight.yang.gen.v1.urn.opendaylight.openflow.protocol.rev130731.OfHeader;
20 import org.slf4j.Logger;
21 import org.slf4j.LoggerFactory;
23 final class OutboundQueueImpl implements OutboundQueue {
24 private static final Logger LOG = LoggerFactory.getLogger(OutboundQueueImpl.class);
25 private static final AtomicIntegerFieldUpdater<OutboundQueueImpl> CURRENT_OFFSET_UPDATER =
26 AtomicIntegerFieldUpdater.newUpdater(OutboundQueueImpl.class, "reserveOffset");
27 private static final AtomicIntegerFieldUpdater<OutboundQueueImpl> BARRIER_OFFSET_UPDATER =
28 AtomicIntegerFieldUpdater.newUpdater(OutboundQueueImpl.class, "barrierOffset");
29 private final OutboundQueueManager<?> manager;
30 private final OutboundQueueEntry[] queue;
31 private final long baseXid;
32 private final long endXid;
33 private final int reserve;
35 // Updated concurrently
36 private volatile int barrierOffset = -1;
37 private volatile int reserveOffset = 0;
39 // Updated from Netty only
40 private int flushOffset;
41 private int completeCount;
42 private int lastBarrierOffset = -1;
44 OutboundQueueImpl(final OutboundQueueManager<?> manager, final long baseXid, final int maxQueue) {
46 * We use the last entry as an emergency should a timeout-triggered
47 * flush request race with normal users for the last entry in this
48 * queue. In that case the flush request will take the last entry and
49 * schedule a flush, which means that we will get around sending the
50 * message as soon as the user finishes the reservation.
52 Preconditions.checkArgument(maxQueue > 1);
53 this.baseXid = baseXid;
54 this.endXid = baseXid + maxQueue;
55 this.reserve = maxQueue - 1;
56 this.manager = Preconditions.checkNotNull(manager);
57 queue = new OutboundQueueEntry[maxQueue];
58 for (int i = 0; i < maxQueue; ++i) {
59 queue[i] = new OutboundQueueEntry();
63 private OutboundQueueImpl(final OutboundQueueManager<?> manager, final long baseXid, final OutboundQueueEntry[] queue) {
64 this.manager = Preconditions.checkNotNull(manager);
65 this.queue = Preconditions.checkNotNull(queue);
66 this.baseXid = baseXid;
67 this.endXid = baseXid + queue.length;
68 this.reserve = queue.length - 1;
69 for (OutboundQueueEntry element : queue) {
74 OutboundQueueImpl reuse(final long baseXid) {
75 return new OutboundQueueImpl(manager, baseXid, queue);
79 public Long reserveEntry() {
80 return reserveEntry(false);
84 public void commitEntry(final Long xid, final OfHeader message, final FutureCallback<OfHeader> callback) {
85 final int offset = (int)(xid - baseXid);
86 if (message != null) {
87 Preconditions.checkArgument(xid.equals(message.getXid()), "Message %s has wrong XID %s, expected %s", message, message.getXid(), xid);
90 final OutboundQueueEntry entry = queue[offset];
91 entry.commit(message, callback);
92 LOG.debug("Queue {} XID {} at offset {} (of {}) committed", this, xid, offset, reserveOffset);
94 if (entry.isBarrier()) {
97 final int prev = BARRIER_OFFSET_UPDATER.getAndSet(this, my);
99 LOG.debug("Queue {} recorded pending barrier offset {}", this, my);
103 // We have traveled back, recover
108 manager.ensureFlushing(this);
111 private Long reserveEntry(final boolean forBarrier) {
112 final int offset = CURRENT_OFFSET_UPDATER.getAndIncrement(this);
113 if (offset >= reserve) {
115 LOG.debug("Queue {} offset {}/{}, using emergency slot", this, offset, queue.length);
118 LOG.debug("Queue {} offset {}/{}, not allowing reservation", this, offset, queue.length);
123 final Long xid = baseXid + offset;
124 LOG.debug("Queue {} allocated XID {} at offset {}", this, xid, offset);
128 Long reserveBarrierIfNeeded() {
129 final int bo = barrierOffset;
130 if (bo >= flushOffset) {
131 LOG.debug("Barrier found at offset {} (currently at {})", bo, flushOffset);
134 return reserveEntry(true);
138 int startShutdown() {
139 // Increment the offset by the queue size, hence preventing any normal
140 // allocations. We should not be seeing a barrier reservation after this
141 // and if there is one issued, we can disregard it.
142 final int offset = CURRENT_OFFSET_UPDATER.getAndAdd(this, queue.length);
144 // If this offset is larger than reserve, trim it. That is not an accurate
145 // view of which slot was actually "reserved", but it indicates at which
146 // entry we can declare the queue flushed (e.g. at the emergency slot).
147 return offset > reserve ? reserve : offset;
150 boolean isShutdown(final int offset) {
151 // This queue is shutdown if the flushOffset (e.g. the next entry to
152 // be flushed) points to the offset 'reserved' in startShutdown()
153 return flushOffset >= offset;
157 * An empty queue is a queue which has no further unflushed entries.
159 * @return True if this queue does not have unprocessed entries.
161 private boolean isEmpty() {
162 int ro = reserveOffset;
164 if (queue[reserve].isCommitted()) {
171 LOG.debug("Effective flush/reserve offset {}/{}", flushOffset, ro);
172 return ro <= flushOffset;
176 * A queue is finished when all of its entries have been completed.
178 * @return False if there are any uncompleted requests.
180 boolean isFinished() {
181 if (completeCount < reserve) {
185 // We need to check if the last entry was used
186 final OutboundQueueEntry last = queue[reserve];
187 return !last.isCommitted() || last.isCompleted();
190 boolean isFlushed() {
191 LOG.debug("Check queue {} for completeness (offset {}, reserve {})", this, flushOffset, reserve);
192 if (flushOffset < reserve) {
196 // flushOffset implied == reserve
197 return flushOffset >= queue.length || !queue[reserve].isCommitted();
200 boolean needsFlush() {
201 if (flushOffset < reserve) {
202 return queue[flushOffset].isCommitted();
206 LOG.trace("Queue {} is flushed, schedule a replace", this);
210 LOG.trace("Queue {} is finished, schedule a cleanup", this);
217 OfHeader flushEntry() {
221 LOG.trace("Flushed all reserved entries up to ", flushOffset);
225 final OutboundQueueEntry entry = queue[flushOffset];
226 if (!entry.isCommitted()) {
227 LOG.trace("Request at offset {} not ready yet, giving up", flushOffset);
231 final OfHeader msg = entry.getMessage();
237 LOG.trace("Null message, skipping to offset {}", flushOffset);
241 // Argument is 'long' to explicitly convert before performing operations
242 private boolean xidInRange(final long xid) {
243 return xid < endXid && (xid >= baseXid || baseXid > endXid);
246 private static boolean completeEntry(final OutboundQueueEntry entry, final OfHeader response) {
247 if (response instanceof Error) {
248 final Error err = (Error)response;
249 LOG.debug("Device-reported request XID {} failed {}:{}", response.getXid(), err.getTypeString(), err.getCodeString());
250 entry.fail(new DeviceRequestFailedException("Device-side failure", err));
253 return entry.complete(response);
258 * Return the request entry corresponding to a response. Returns null
259 * if there is no request matching the response.
261 * @param response Response message
262 * @return Matching request entry, or null if no match is found.
264 OutboundQueueEntry pairRequest(@Nonnull final OfHeader response) {
265 final Long xid = response.getXid();
266 if (!xidInRange(xid)) {
267 LOG.debug("Queue {} {}/{} ignoring XID {}", this, baseXid, queue.length, xid);
271 final int offset = (int)(xid - baseXid);
272 final OutboundQueueEntry entry = queue[offset];
273 if (entry.isCompleted()) {
274 LOG.debug("Entry {} already is completed, not accepting response {}", entry, response);
278 if (entry.isBarrier()) {
279 // This has been a barrier -- make sure we complete all preceding requests.
280 // XXX: Barriers are expected to complete in one message.
281 // If this assumption is changed, this logic will need to be expanded
282 // to ensure that the requests implied by the barrier are reported as
283 // completed *after* the barrier.
284 LOG.trace("Barrier XID {} completed, cascading completion to XIDs {} to {}", xid, baseXid + lastBarrierOffset + 1, xid - 1);
285 completeRequests(offset);
286 lastBarrierOffset = offset;
288 final boolean success = completeEntry(entry, response);
289 Verify.verify(success, "Barrier request failed to complete");
291 } else if (completeEntry(entry, response)) {
298 private void completeRequests(final int toOffset) {
299 for (int i = lastBarrierOffset + 1; i < toOffset; ++i) {
300 final OutboundQueueEntry entry = queue[i];
301 if (!entry.isCompleted() && entry.complete(null)) {
308 completeRequests(queue.length);
311 int failAll(final OutboundQueueException cause) {
313 for (int i = lastBarrierOffset + 1; i < queue.length; ++i) {
314 final OutboundQueueEntry entry = queue[i];
315 if (!entry.isCommitted()) {
319 if (!entry.isCompleted()) {