/*
* 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.lock.singlelock.replicated.pessimistic;
import org.infinispan.config.Configuration;
import org.infinispan.lock.singlelock.AbstractNoCrashTest;
import org.infinispan.test.AbstractInfinispanTest;
import org.infinispan.transaction.LockingMode;
import org.infinispan.transaction.tm.DummyTransaction;
import org.testng.annotations.Test;
/**
* @author Mircea Markus
* @since 5.1
*/
@Test (groups = "functional", testName = "singlelock.replicated.pessimistic.BasicSingleLockRepPessimisticTest")
public class BasicSingleLockRepPessimisticTest extends AbstractNoCrashTest {
public BasicSingleLockRepPessimisticTest() {
super(Configuration.CacheMode.REPL_SYNC, LockingMode.PESSIMISTIC, false);
}
protected void testTxAndLockOnDifferentNodes(AbstractNoCrashTest.Operation operation, boolean addFirst, boolean removed) throws Exception {
if (addFirst)
cache(0).put("k", "v_initial");
assertNotLocked("k");
tm(0).begin();
operation.perform("k", 0);
assert lockManager(0).isLocked("k");
assert !lockManager(1).isLocked("k");
assert !lockManager(2).isLocked("k");
tm(0).commit();
assertNotLocked("k");
assertValue("k", removed);
}
public void testMultipleLocksInSameTx() throws Exception {
tm(0).begin();
cache(0).put("k1", "v");
cache(0).put("k2", "v");
assert lockManager(0).isLocked("k1");
assert lockManager(0).isLocked("k2");
assert !lockManager(1).isLocked("k1");
assert !lockManager(1).isLocked("k2");
assert !lockManager(1).isLocked("k2");
assert !lockManager(2).isLocked("k2");
tm(0).commit();
assertNotLocked("k1");
assertNotLocked("k2");
assertValue("k1", false);
assertValue("k2", false);
}
public void testTxAndLockOnSameNode() throws Exception {
tm(0).begin();
cache(0).put("k0", "v");
assert lockManager(0).isLocked("k0");
assert !lockManager(1).isLocked("k0");
assert !lockManager(2).isLocked("k0");
tm(0).commit();
assertNotLocked("k0");
assertValue("k0", false);
}
public void testSecondTxCannotPrepare1() throws Exception {
tm(0).begin();
cache(0).put("k0", "v");
DummyTransaction dtm = (DummyTransaction) tm(0).suspend();
assert checkTxCount(0, 1, 0);
assert checkTxCount(1, 0, 0);
assert checkTxCount(2, 0, 0);
tm(0).begin();
try {
cache(0).put("k0", "other");
assert false;
} catch (Throwable e) {
tm(0).rollback();
}
eventually(new AbstractInfinispanTest.Condition() {
@Override
public boolean isSatisfied() throws Exception {
return checkTxCount(0, 1, 0) && checkTxCount(1, 0, 0) && checkTxCount(2, 0, 0);
}
});
tm(1).begin();
try {
cache(1).put("k0", "other");
assert false;
} catch (Throwable e) {
tm(0).rollback();
}
eventually(new AbstractInfinispanTest.Condition() {
@Override
public boolean isSatisfied() throws Exception {
return checkTxCount(0, 1, 0) && checkTxCount(1, 0, 0) && checkTxCount(2, 0, 0);
}
});
tm(0).resume(dtm);
tm(0).commit();
assertValue("k0", false);
eventually(new AbstractInfinispanTest.Condition() {
@Override
public boolean isSatisfied() throws Exception {
return noPendingTransactions(0) && noPendingTransactions(1) && noPendingTransactions(2);
}
});
}
public void testSecondTxCannotPrepare2() throws Exception {
tm(1).begin();
cache(1).put("k0", "v");
DummyTransaction dtm = (DummyTransaction) tm(1).suspend();
assert checkTxCount(0, 0, 1);
assert checkTxCount(1, 1, 0);
assert checkTxCount(2, 0, 1);
tm(0).begin();
try {
cache(0).put("k0", "other");
assert false;
} catch (Throwable e) {
tm(0).rollback();
}
eventually(new AbstractInfinispanTest.Condition() {
@Override
public boolean isSatisfied() throws Exception {
return checkTxCount(0, 0, 1) && checkTxCount(1, 1, 0) && checkTxCount(2, 0, 1);
}
});
tm(1).begin();
try {
cache(1).put("k0", "other");
assert false;
} catch (Throwable e) {
tm(0).rollback();
}
eventually(new AbstractInfinispanTest.Condition() {
@Override
public boolean isSatisfied() throws Exception {
return checkTxCount(0, 0, 1) && checkTxCount(1, 1, 0) && checkTxCount(2, 0, 1);
}
});
tm(0).resume(dtm);
tm(0).commit();
assertValue("k0", false);
eventually(new AbstractInfinispanTest.Condition() {
@Override
public boolean isSatisfied() throws Exception {
return noPendingTransactions(0) && noPendingTransactions(1) && noPendingTransactions(2);
}
});
}
}