package org.cache2k.benchmark.jmh.suite.eviction.symmetrical; /* * #%L * Benchmarks: JMH suite. * %% * Copyright (C) 2013 - 2017 headissue GmbH, Munich * %% * 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. * #L% */ import org.cache2k.benchmark.BenchmarkCache; import org.cache2k.benchmark.jmh.BenchmarkBase; import org.openjdk.jmh.annotations.Benchmark; import org.openjdk.jmh.annotations.BenchmarkMode; import org.openjdk.jmh.annotations.Level; import org.openjdk.jmh.annotations.Mode; import org.openjdk.jmh.annotations.Scope; import org.openjdk.jmh.annotations.Setup; import org.openjdk.jmh.annotations.State; import org.openjdk.jmh.annotations.TearDown; import java.util.concurrent.atomic.AtomicInteger; /** * Continuously access a cache of size 1M an ascending sequence, never producing any hit. * Each thread starts at another offset. * * @author Jens Wilke */ @State(Scope.Benchmark) public class NeverHitBenchmark extends BenchmarkBase { public static final int ENTRY_COUNT = 1000 * 1000; private final static AtomicInteger offset = new AtomicInteger(0); @State(Scope.Thread) public static class ThreadState { long index = offset.getAndAdd(Integer.MAX_VALUE / 16); } BenchmarkCache<Integer, Integer> cache; @Setup(Level.Iteration) public void setup() throws Exception { cache = getFactory().create(ENTRY_COUNT); } @TearDown(Level.Iteration) public void tearDown() { recordMemoryAndDestroy(cache); cache = null; } @Benchmark @BenchmarkMode(Mode.Throughput) public long operation(ThreadState threadState, HitCountRecorder rec) { int idx = (int) (threadState.index++); Integer k = idx; Integer v = cache.getIfPresent(k); if (v != null) { rec.hitCount++; } else { rec.missCount++; } cache.put(k, k); return idx; } }