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