com.hazelcast.simulator.tests.map.MapCasTest Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of driver-hazelcast4 Show documentation
The newest version!
/*
 * Copyright (c) 2008-2016, Hazelcast, Inc. All Rights Reserved.
 *
 * 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 com.hazelcast.simulator.tests.map;

import com.hazelcast.map.IMap;
import com.hazelcast.simulator.hz.HazelcastTest;
import com.hazelcast.simulator.test.BaseThreadState;
import com.hazelcast.simulator.test.TestException;
import com.hazelcast.simulator.test.annotations.AfterRun;
import com.hazelcast.simulator.test.annotations.BeforeRun;
import com.hazelcast.simulator.test.annotations.Prepare;
import com.hazelcast.simulator.test.annotations.Setup;
import com.hazelcast.simulator.test.annotations.Teardown;
import com.hazelcast.simulator.test.annotations.TimeStep;
import com.hazelcast.simulator.test.annotations.Verify;

import java.util.HashMap;
import java.util.Map;

import static com.hazelcast.simulator.utils.UuidUtil.newSecureUuidString;
import static org.junit.Assert.assertEquals;

/**
 * This tests the cas method: replace. So for optimistic concurrency control.
 *
 * We have a bunch of predefined keys, and we are going to concurrently increment the value and we protect ourselves against lost
 * updates using cas method replace.
 *
 * Locally we keep track of all increments, and if the sum of these local increments matches the global increment, we are done.
 */
public class MapCasTest extends HazelcastTest {

    // properties
    public int keyCount = 1000;

    private IMap map;
    private IMap> resultsPerWorker;

    @Setup
    public void setUp() {
        map = targetInstance.getMap(name);
        resultsPerWorker = targetInstance.getMap(name + ":ResultMap");
    }

    @Prepare(global = true)
    public void prepare() {
        for (int i = 0; i < keyCount; i++) {
            map.put(i, 0L);
        }
    }

    @BeforeRun
    public void beforeRun(ThreadState state) {
        int size = map.size();
        if (size != keyCount) {
            throw new TestException(
                    "Prepare has not run since the map is not filled correctly, found size: %s, expected size: %s",
                    size, keyCount);
        }

        for (int i = 0; i < keyCount; i++) {
            state.result.put(i, 0L);
        }
    }

    @TimeStep
    public void timeStep(ThreadState state) throws Exception {
        Integer key = state.randomInt(keyCount);
        long incrementValue = state.randomInt(100);

        for (; ; ) {
            Long current = map.get(key);
            Long update = current + incrementValue;
            if (map.replace(key, current, update)) {
                state.increment(key, incrementValue);
                break;
            }
        }
    }

    @AfterRun
    public void afterRun(ThreadState state) {
        resultsPerWorker.put(newSecureUuidString(), state.result);
    }

    public class ThreadState extends BaseThreadState {
        private final Map result = new HashMap<>();

        private void increment(int key, long increment) {
            result.put(key, result.get(key) + increment);
        }
    }

    @Verify
    public void verify() {
        long[] amount = new long[keyCount];

        for (Map workerResult : resultsPerWorker.values()) {
            for (Map.Entry entry : workerResult.entrySet()) {
                amount[entry.getKey()] += entry.getValue();
            }
        }

        int failures = 0;
        for (int i = 0; i < keyCount; i++) {
            long expected = amount[i];
            long found = map.get(i);
            if (expected != found) {
                failures++;
            }
        }

        assertEquals("There should not be any data races", 0, failures);
    }

    @Teardown
    public void tearDown() {
        map.destroy();
        resultsPerWorker.destroy();
    }
}