Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* 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;
import io.netty.util.internal.shaded.org.jctools.util.RangeUtil;
import java.util.AbstractQueue;
import java.util.Iterator;
import static io.netty.util.internal.shaded.org.jctools.util.PortableJvmInfo.CPUs;
import static io.netty.util.internal.shaded.org.jctools.util.Pow2.isPowerOfTwo;
import static io.netty.util.internal.shaded.org.jctools.util.Pow2.roundToPowerOfTwo;
/**
* Use a set number of parallel MPSC queues to diffuse the contention on tail.
*/
abstract class MpscCompoundQueueL0Pad extends AbstractQueue implements MessagePassingQueue
{
long p01, p02, p03, p04, p05, p06, p07;
long p10, p11, p12, p13, p14, p15, p16, p17;
}
abstract class MpscCompoundQueueColdFields extends MpscCompoundQueueL0Pad
{
// must be power of 2
protected final int parallelQueues;
protected final int parallelQueuesMask;
protected final MpscArrayQueue[] queues;
@SuppressWarnings("unchecked")
MpscCompoundQueueColdFields(int capacity, int queueParallelism)
{
parallelQueues = isPowerOfTwo(queueParallelism) ? queueParallelism
: roundToPowerOfTwo(queueParallelism) / 2;
parallelQueuesMask = parallelQueues - 1;
queues = new MpscArrayQueue[parallelQueues];
int fullCapacity = roundToPowerOfTwo(capacity);
RangeUtil.checkGreaterThanOrEqual(fullCapacity, parallelQueues, "fullCapacity");
for (int i = 0; i < parallelQueues; i++)
{
queues[i] = new MpscArrayQueue(fullCapacity / parallelQueues);
}
}
}
abstract class MpscCompoundQueueMidPad extends MpscCompoundQueueColdFields
{
long p01, p02, p03, p04, p05, p06, p07;
long p10, p11, p12, p13, p14, p15, p16, p17;
public MpscCompoundQueueMidPad(int capacity, int queueParallelism)
{
super(capacity, queueParallelism);
}
}
abstract class MpscCompoundQueueConsumerQueueIndex extends MpscCompoundQueueMidPad
{
int consumerQueueIndex;
MpscCompoundQueueConsumerQueueIndex(int capacity, int queueParallelism)
{
super(capacity, queueParallelism);
}
}
public class MpscCompoundQueue extends MpscCompoundQueueConsumerQueueIndex
{
long p01, p02, p03, p04, p05, p06, p07;
long p10, p11, p12, p13, p14, p15, p16, p17;
public MpscCompoundQueue(int capacity)
{
this(capacity, CPUs);
}
public MpscCompoundQueue(int capacity, int queueParallelism)
{
super(capacity, queueParallelism);
}
@Override
public boolean offer(final E e)
{
if (null == e)
{
throw new NullPointerException();
}
final int parallelQueuesMask = this.parallelQueuesMask;
int start = (int) (Thread.currentThread().getId() & parallelQueuesMask);
final MpscArrayQueue[] queues = this.queues;
if (queues[start].offer(e))
{
return true;
}
else
{
return slowOffer(queues, parallelQueuesMask, start + 1, e);
}
}
private boolean slowOffer(MpscArrayQueue[] queues, int parallelQueuesMask, int start, E e)
{
final int queueCount = parallelQueuesMask + 1;
final int end = start + queueCount;
while (true)
{
int status = 0;
for (int i = start; i < end; i++)
{
int s = queues[i & parallelQueuesMask].failFastOffer(e);
if (s == 0)
{
return true;
}
status += s;
}
if (status == queueCount)
{
return false;
}
}
}
@Override
public E poll()
{
int qIndex = consumerQueueIndex & parallelQueuesMask;
int limit = qIndex + parallelQueues;
E e = null;
for (; qIndex < limit; qIndex++)
{
e = queues[qIndex & parallelQueuesMask].poll();
if (e != null)
{
break;
}
}
consumerQueueIndex = qIndex;
return e;
}
@Override
public E peek()
{
int qIndex = consumerQueueIndex & parallelQueuesMask;
int limit = qIndex + parallelQueues;
E e = null;
for (; qIndex < limit; qIndex++)
{
e = queues[qIndex & parallelQueuesMask].peek();
if (e != null)
{
break;
}
}
consumerQueueIndex = qIndex;
return e;
}
@Override
public int size()
{
int size = 0;
for (MpscArrayQueue lane : queues)
{
size += lane.size();
}
return size;
}
@Override
public Iterator iterator()
{
throw new UnsupportedOperationException();
}
@Override
public String toString()
{
return this.getClass().getName();
}
@Override
public boolean relaxedOffer(E e)
{
if (null == e)
{
throw new NullPointerException();
}
final int parallelQueuesMask = this.parallelQueuesMask;
int start = (int) (Thread.currentThread().getId() & parallelQueuesMask);
final MpscArrayQueue[] queues = this.queues;
if (queues[start].failFastOffer(e) == 0)
{
return true;
}
else
{
// we already offered to first queue, try the rest
for (int i = start + 1; i < start + parallelQueuesMask + 1; i++)
{
if (queues[i & parallelQueuesMask].failFastOffer(e) == 0)
{
return true;
}
}
// this is a relaxed offer, we can fail for any reason we like
return false;
}
}
@Override
public E relaxedPoll()
{
int qIndex = consumerQueueIndex & parallelQueuesMask;
int limit = qIndex + parallelQueues;
E e = null;
for (; qIndex < limit; qIndex++)
{
e = queues[qIndex & parallelQueuesMask].relaxedPoll();
if (e != null)
{
break;
}
}
consumerQueueIndex = qIndex;
return e;
}
@Override
public E relaxedPeek()
{
int qIndex = consumerQueueIndex & parallelQueuesMask;
int limit = qIndex + parallelQueues;
E e = null;
for (; qIndex < limit; qIndex++)
{
e = queues[qIndex & parallelQueuesMask].relaxedPeek();
if (e != null)
{
break;
}
}
consumerQueueIndex = qIndex;
return e;
}
@Override
public int capacity()
{
return queues.length * queues[0].capacity();
}
@Override
public int drain(Consumer c)
{
final int limit = capacity();
return drain(c, limit);
}
@Override
public int fill(Supplier s)
{
return MessagePassingQueueUtil.fillBounded(this, s);
}
@Override
public int drain(Consumer c, int limit)
{
return MessagePassingQueueUtil.drain(this, c, limit);
}
@Override
public int fill(Supplier s, int limit)
{
if (null == s)
throw new IllegalArgumentException("supplier is null");
if (limit < 0)
throw new IllegalArgumentException("limit is negative:" + limit);
if (limit == 0)
return 0;
final int parallelQueuesMask = this.parallelQueuesMask;
int start = (int) (Thread.currentThread().getId() & parallelQueuesMask);
final MpscArrayQueue[] queues = this.queues;
int filled = queues[start].fill(s, limit);
if (filled == limit)
{
return limit;
}
else
{
// we already offered to first queue, try the rest
for (int i = start + 1; i < start + parallelQueuesMask + 1; i++)
{
filled += queues[i & parallelQueuesMask].fill(s, limit - filled);
if (filled == limit)
{
return limit;
}
}
// this is a relaxed offer, we can fail for any reason we like
return filled;
}
}
@Override
public void drain(Consumer c, WaitStrategy wait, ExitCondition exit)
{
MessagePassingQueueUtil.drain(this, c, wait, exit);
}
@Override
public void fill(Supplier s, WaitStrategy wait, ExitCondition exit)
{
MessagePassingQueueUtil.fill(this, s, wait, exit);
}
}
