/*
* JBoss, Home of Professional Open Source
* Copyright 2011 Red Hat Inc. and/or its affiliates and other
* contributors as indicated by the @author tags. All rights reserved.
* See the copyright.txt in the distribution for a full listing of
* individual contributors.
*
* This is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* This software is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this software; if not, write to the Free
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA, or see the FSF site: http://www.fsf.org.
*/
package org.infinispan.distribution;
import org.infinispan.Cache;
import org.infinispan.config.CacheLoaderManagerConfig;
import org.infinispan.config.Configuration;
import org.infinispan.loaders.dummy.DummyInMemoryCacheStore;
import org.infinispan.remoting.transport.Address;
import org.infinispan.test.MultipleCacheManagersTest;
import org.testng.annotations.Test;
import java.util.HashSet;
import java.util.Set;
import static java.lang.String.format;
import static org.infinispan.distribution.DistributionTestHelper.addressOf;
import static org.infinispan.distribution.DistributionTestHelper.isOwner;
/**
* This tests the access pattern where a Tx touches multiple keys such that: K1: {A, B} K2: {A, C}
* <p/>
* The tx starts and runs on A, and the TX must succeed even though each node only gets a subset of data. Particularly,
* needs to be checked when using a cache store.
*/
@Test(testName = "distribution.DistCacheStoreTxDisjointSetTest", groups = "functional")
public class DistCacheStoreTxDisjointSetTest extends MultipleCacheManagersTest {
@Override
protected void createCacheManagers() throws Throwable {
Configuration c = getDefaultClusteredConfig(Configuration.CacheMode.DIST_SYNC, true);
c.setCacheLoaderManagerConfig(new CacheLoaderManagerConfig(new DummyInMemoryCacheStore.Cfg("DistCacheStoreTxDisjointSetTest0")));
addClusterEnabledCacheManager(c);
c.setCacheLoaderManagerConfig(new CacheLoaderManagerConfig(new DummyInMemoryCacheStore.Cfg("DistCacheStoreTxDisjointSetTest1")));
addClusterEnabledCacheManager(c);
c.setCacheLoaderManagerConfig(new CacheLoaderManagerConfig(new DummyInMemoryCacheStore.Cfg("DistCacheStoreTxDisjointSetTest2")));
addClusterEnabledCacheManager(c);
waitForClusterToForm();
}
public void testDisjointSetTransaction() throws Exception {
MagicKey k1 = new MagicKey(cache(0));
MagicKey k2 = new MagicKey(cache(1));
// make sure the owners of k1 and k2 are NOT the same!
Set<Address> k1Owners = new HashSet<Address>();
Set<Address> k2Owners = new HashSet<Address>();
for (Cache<?, ?> cache: caches()) {
if (isOwner(cache, k1)) k1Owners.add(addressOf(cache));
if (isOwner(cache, k2)) k2Owners.add(addressOf(cache));
}
assert k1Owners.size() == 2: "Expected 2 owners for k1; was " + k1Owners;
assert k2Owners.size() == 2: "Expected 2 owners for k1; was " + k2Owners;
assert !k1Owners.equals(k2Owners) : format("k1 and k2 should have different ownership set. Was %s and %s", k1Owners, k2Owners);
tm(0).begin();
cache(0).put(k1, "v1");
cache(0).put(k2, "v2");
tm(0).commit();
}
}