1 /* 2 * Copyright (c) 2014 Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. Oracle designates this 8 * particular file as subject to the "Classpath" exception as provided 9 * by Oracle in the LICENSE file that accompanied this code. 10 * 11 * This code is distributed in the hope that it will be useful, but WITHOUT 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 * version 2 for more details (a copy is included in the LICENSE file that 15 * accompanied this code). 16 * 17 * You should have received a copy of the GNU General Public License version 18 * 2 along with this work; if not, write to the Free Software Foundation, 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 20 * 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 22 * or visit www.oracle.com if you need additional information or have any 23 * questions. 24 */ 25 package org.openjdk.bench.java.util.concurrent; 26 27 import org.openjdk.jmh.annotations.Benchmark; 28 import org.openjdk.jmh.annotations.BenchmarkMode; 29 import org.openjdk.jmh.annotations.Mode; 30 import org.openjdk.jmh.annotations.OutputTimeUnit; 31 import org.openjdk.jmh.annotations.Param; 32 import org.openjdk.jmh.annotations.Scope; 33 import org.openjdk.jmh.annotations.Setup; 34 import org.openjdk.jmh.annotations.State; 35 import org.openjdk.jmh.infra.Blackhole; 36 37 import java.util.concurrent.ArrayBlockingQueue; 38 import java.util.concurrent.BlockingQueue; 39 import java.util.concurrent.LinkedBlockingQueue; 40 import java.util.concurrent.PriorityBlockingQueue; 41 import java.util.concurrent.TimeUnit; 42 43 @BenchmarkMode(Mode.AverageTime) 44 @OutputTimeUnit(TimeUnit.NANOSECONDS) 45 @State(Scope.Benchmark) 46 public class Queues { 47 48 @Param("100") 49 private int capacity; 50 51 @Param 52 private QueueType type; 53 54 public enum QueueType { 55 LBQ, 56 ABQ_NF, 57 ABQ_F, 58 PBQ, 59 } 60 61 private BlockingQueue<Integer> q; 62 63 @Setup 64 public void setup() { 65 switch (type) { 66 case ABQ_F: 67 q = new ArrayBlockingQueue<>(capacity, true); 68 break; 69 case ABQ_NF: 70 q = new ArrayBlockingQueue<>(capacity, false); 71 break; 72 case LBQ: 73 q = new LinkedBlockingQueue<>(capacity); 74 break; 75 case PBQ: 76 q = new PriorityBlockingQueue<>(capacity); 77 break; 78 default: 79 throw new RuntimeException(); 80 } 81 } 82 83 @Benchmark 84 public void test() { 85 try { 86 int l = (int) System.nanoTime(); 87 Integer item = q.poll(); 88 if (item != null) { 89 Blackhole.consumeCPU(5); 90 } else { 91 Blackhole.consumeCPU(10); 92 while (!q.offer(l)) { 93 Blackhole.consumeCPU(5); 94 } 95 } 96 } catch (Exception ie) { 97 throw new Error("iteration failed"); 98 } 99 } 100 101 }