View Javadoc
1   /*
2    * Copyright 2017 The Netty Project
3    *
4    * The Netty Project licenses this file to you under the Apache License,
5    * version 2.0 (the "License"); you may not use this file except in compliance
6    * with the License. You may obtain a copy of the License at:
7    *
8    *   https://www.apache.org/licenses/LICENSE-2.0
9    *
10   * Unless required by applicable law or agreed to in writing, software
11   * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
12   * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
13   * License for the specific language governing permissions and limitations
14   * under the License.
15   */
16  package io.netty.handler.codec;
17  
18  import io.netty.microbench.util.AbstractMicrobenchmark;
19  import org.openjdk.jmh.annotations.Benchmark;
20  import org.openjdk.jmh.annotations.Param;
21  import org.openjdk.jmh.annotations.Scope;
22  import org.openjdk.jmh.annotations.State;
23  import org.openjdk.jmh.annotations.Threads;
24  
25  @State(Scope.Benchmark)
26  @Threads(16)
27  public class AdvancedCodecOutputListBenchmark extends AbstractMicrobenchmark {
28  
29      private static final Object ELEMENT = new Object();
30  
31      @Param({ "1", "4" })
32      public int elements;
33  
34      @Benchmark
35      public boolean codecOutListAllocRecycle() {
36          return benchmark(elements, CodecOutputList.newInstance(), CodecOutputList.newInstance(),
37                  CodecOutputList.newInstance(), CodecOutputList.newInstance());
38      }
39  
40      private static boolean benchmark(int elements, CodecOutputList list1, CodecOutputList list2,
41                                       CodecOutputList list3, CodecOutputList list4) {
42          return (benchmark(elements, list1) == benchmark(elements, list2)) ==
43                  (benchmark(elements, list3) == benchmark(elements, list4));
44      }
45  
46      private static boolean benchmark(int elements, CodecOutputList list) {
47          for (int i = 0; i < elements; ++i) {
48              list.add(ELEMENT);
49          }
50          list.recycle();
51          return list.insertSinceRecycled();
52      }
53  }