All Downloads are FREE. Search and download functionalities are using the official Maven repository.

io.netty.util.internal.shaded.org.jctools.queues.atomic.AtomicReferenceArrayQueue Maven / Gradle / Ivy

There is a newer version: 5.0.0.Alpha2
Show newest version
/*
 * Licensed 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 io.netty.util.internal.shaded.org.jctools.queues.atomic;

import io.netty.util.internal.shaded.org.jctools.queues.IndexedQueueSizeUtil;
import io.netty.util.internal.shaded.org.jctools.queues.IndexedQueueSizeUtil.IndexedQueue;
import io.netty.util.internal.shaded.org.jctools.queues.MessagePassingQueue;
import io.netty.util.internal.shaded.org.jctools.queues.QueueProgressIndicators;
import io.netty.util.internal.shaded.org.jctools.queues.SupportsIterator;
import io.netty.util.internal.shaded.org.jctools.util.Pow2;

import java.util.AbstractQueue;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.concurrent.atomic.AtomicReferenceArray;

import static io.netty.util.internal.shaded.org.jctools.queues.atomic.AtomicQueueUtil.*;

abstract class AtomicReferenceArrayQueue extends AbstractQueue implements IndexedQueue, QueueProgressIndicators, MessagePassingQueue, SupportsIterator
{
    protected final AtomicReferenceArray buffer;
    protected final int mask;

    public AtomicReferenceArrayQueue(int capacity)
    {
        int actualCapacity = Pow2.roundToPowerOfTwo(capacity);
        this.mask = actualCapacity - 1;
        this.buffer = new AtomicReferenceArray(actualCapacity);
    }

    @Override
    public String toString()
    {
        return this.getClass().getName();
    }

    @Override
    public void clear()
    {
        while (poll() != null)
        {
            // toss it away
        }
    }

    @Override
    public final int capacity()
    {
        return (int) (mask + 1);
    }

    /**
     * {@inheritDoc}
     * 

*/ @Override public final int size() { return IndexedQueueSizeUtil.size(this); } @Override public final boolean isEmpty() { return IndexedQueueSizeUtil.isEmpty(this); } @Override public final long currentProducerIndex() { return lvProducerIndex(); } @Override public final long currentConsumerIndex() { return lvConsumerIndex(); } /** * Get an iterator for this queue. This method is thread safe. *

* The iterator provides a best-effort snapshot of the elements in the queue. * The returned iterator is not guaranteed to return elements in queue order, * and races with the consumer thread may cause gaps in the sequence of returned elements. * Like {link #relaxedPoll}, the iterator may not immediately return newly inserted elements. * * @return The iterator. */ @Override public final Iterator iterator() { final long cIndex = lvConsumerIndex(); final long pIndex = lvProducerIndex(); return new WeakIterator(cIndex, pIndex, mask, buffer); } private static class WeakIterator implements Iterator { private final long pIndex; private final int mask; private final AtomicReferenceArray buffer; private long nextIndex; private E nextElement; WeakIterator(long cIndex, long pIndex, int mask, AtomicReferenceArray buffer) { this.nextIndex = cIndex; this.pIndex = pIndex; this.mask = mask; this.buffer = buffer; nextElement = getNext(); } @Override public void remove() { throw new UnsupportedOperationException("remove"); } @Override public boolean hasNext() { return nextElement != null; } @Override public E next() { final E e = nextElement; if (e == null) throw new NoSuchElementException(); nextElement = getNext(); return e; } private E getNext() { final int mask = this.mask; final AtomicReferenceArray buffer = this.buffer; while (nextIndex < pIndex) { int offset = calcCircularRefElementOffset(nextIndex++, mask); E e = lvRefElement(buffer, offset); if (e != null) { return e; } } return null; } } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy