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.util.Pow2;

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


abstract class AtomicReferenceArrayQueue extends AbstractQueue implements IndexedQueue, QueueProgressIndicators, MessagePassingQueue
{
    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 Iterator iterator()
    {
        throw new UnsupportedOperationException();
    }

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

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

    protected final int calcElementOffset(long index, int mask)
    {
        return (int) index & mask;
    }

    protected final int calcElementOffset(long index)
    {
        return (int) index & mask;
    }

    public static  E lvElement(AtomicReferenceArray buffer, int offset)
    {
        return buffer.get(offset);
    }

    public static  E lpElement(AtomicReferenceArray buffer, int offset)
    {
        return buffer.get(offset); // no weaker form available
    }

    protected final E lpElement(int offset)
    {
        return buffer.get(offset); // no weaker form available
    }

    public static  void spElement(AtomicReferenceArray buffer, int offset, E value)
    {
        buffer.lazySet(offset, value);  // no weaker form available
    }

    protected final void spElement(int offset, E value)
    {
        buffer.lazySet(offset, value);  // no weaker form available
    }

    public static  void soElement(AtomicReferenceArray buffer, int offset, E value)
    {
        buffer.lazySet(offset, value);
    }

    protected final void soElement(int offset, E value)
    {
        buffer.lazySet(offset, value);
    }

    public static  void svElement(AtomicReferenceArray buffer, int offset, E value)
    {
        buffer.set(offset, value);
    }

    protected final E lvElement(int offset)
    {
        return lvElement(buffer, offset);
    }

    @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(); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy