com.alibaba.rocketmq.shade.io.netty.util.internal.BaseLinkedQueue Maven / Gradle / Ivy

Go to download
/*
 * Copyright 2016 The Netty Project
 *
 * The Netty Project 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.
 */
/*
 * 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;

import java.util.AbstractQueue;
import java.util.Iterator;

/**
 * Forked from JCTools.
 *
 * A base data structure for concurrent linked queues.
 *
 * @param 
 */
abstract class BaseLinkedQueue extends BaseLinkedQueueConsumerNodeRef {
    long p01, p02, p03, p04, p05, p06, p07;
    long p10, p11, p12, p13, p14, p15, p16, p17;

    @Override
    public final Iterator iterator() {
        throw new UnsupportedOperationException();
    }

    /**
     * {@inheritDoc} 

     * 
     * IMPLEMENTATION NOTES:

     * This is an O(n) operation as we run through all the nodes and count them.

     *
     * @see java.util.Queue#size()
     */
    @Override
    public final int size() {
        // Read consumer first, this is important because if the producer is node is 'older' than the consumer the
        // consumer may overtake it (consume past it). This will lead to an infinite loop below.
        LinkedQueueNode chaserNode = lvConsumerNode();
        final LinkedQueueNode producerNode = lvProducerNode();
        int size = 0;
        // must chase the nodes all the way to the producer node, but there's no need to chase a moving target.
        while (chaserNode != producerNode && size < Integer.MAX_VALUE) {
            LinkedQueueNode next;
            while ((next = chaserNode.lvNext()) == null) {
                continue;
            }
            chaserNode = next;
            size++;
        }
        return size;
    }

    /**
     * {@inheritDoc} 

     * 
     * IMPLEMENTATION NOTES:

     * Queue is empty when producerNode is the same as consumerNode. An alternative implementation would be to observe
     * the producerNode.value is null, which also means an empty queue because only the consumerNode.value is allowed to
     * be null.
     *
     * @see MessagePassingQueue#isEmpty()
     */
    @Override
    public final boolean isEmpty() {
        return lvConsumerNode() == lvProducerNode();
    }

    @Override
    public int capacity() {
        return UNBOUNDED_CAPACITY;
    }
}

abstract class BaseLinkedQueuePad0 extends AbstractQueue implements MessagePassingQueue {
    long p00, p01, p02, p03, p04, p05, p06, p07;
    long p10, p11, p12, p13, p14, p15, p16;
}

abstract class BaseLinkedQueueProducerNodeRef extends BaseLinkedQueuePad0 {
    protected static final long P_NODE_OFFSET;

    static {
        try {
            P_NODE_OFFSET = PlatformDependent0.objectFieldOffset(
                    BaseLinkedQueueProducerNodeRef.class.getDeclaredField("producerNode"));
        } catch (NoSuchFieldException e) {
            throw new RuntimeException(e);
        }
    }
    protected LinkedQueueNode producerNode;
    protected final void spProducerNode(LinkedQueueNode node) {
        producerNode = node;
    }

    @SuppressWarnings("unchecked")
    protected final LinkedQueueNode lvProducerNode() {
        return (LinkedQueueNode) PlatformDependent0.getObjectVolatile(this, P_NODE_OFFSET);
    }

    protected final LinkedQueueNode lpProducerNode() {
        return producerNode;
    }
}

abstract class BaseLinkedQueuePad1 extends BaseLinkedQueueProducerNodeRef {
    long p01, p02, p03, p04, p05, p06, p07;
    long p10, p11, p12, p13, p14, p15, p16, p17;
}

abstract class BaseLinkedQueueConsumerNodeRef extends BaseLinkedQueuePad1 {
    protected static final long C_NODE_OFFSET;

    static {
        try {
            C_NODE_OFFSET = PlatformDependent0.objectFieldOffset(
                    BaseLinkedQueueConsumerNodeRef.class.getDeclaredField("consumerNode"));
        } catch (NoSuchFieldException e) {
            throw new RuntimeException(e);
        }
    }
    protected LinkedQueueNode consumerNode;
    protected final void spConsumerNode(LinkedQueueNode node) {
        consumerNode = node;
    }

    @SuppressWarnings("unchecked")
    protected final LinkedQueueNode lvConsumerNode() {
        return (LinkedQueueNode) PlatformDependent0.getObjectVolatile(this, C_NODE_OFFSET);
    }

    protected final LinkedQueueNode lpConsumerNode() {
        return consumerNode;
    }
}